Elliptic polynomial cryptography with multi x-coordinates embedding

ABSTRACT

Given a set of elliptic points that satisfy an elliptic polynomial equation defined over a finite field F which requires N-bits to represent its elements, a method of cryptographic encryption and decryption is presented which uses more than one cubic variable that are termed x-coordinates to obtain an elliptic polynomial equation with multi x-coordinates instead of one x-coordinate. The additional nx x-coordinates are used to embed extra message data bits. A nx-fold increase in the number of embedded message data bits in a single elliptic point can be achieved with the improved method. The reason is that the number of points that satisfy an elliptic polynomial equation defined over F and which can be used in the corresponding cryptosystem is increased by a factor of (#F) nx , where # denotes the size of a field. The use of additional x-coordinates can be used to reduce computational complexity. Alternatively, this can be used to increase security by making the bit positions where data bits are embedded known only to the sender and receiver. Also, it can be used as a countermeasure by randomizing the bit positions where data bits are embedded.

FIELD OF THE INVENTION

This invention relates to a method for Elliptic Polynomial Cryptography with multi x-coordinates embedding and more particularly to a method for encrypting and decrypting a message bit string using a set of points defined over an extended dimensional space that incorporates more than one cubic variable that are termed x-coordinates, and wherein the addition of any two of these points is defined over the extended dimensional space, and wherein this addition is computed using arithmetic over a finite field F.

BACKGROUND FOR THE INVENTION

Cryptography provides methods of providing privacy and authenticity for remote communications and data storage. Privacy is achieved by encryption of data, usually using the techniques of symmetric cryptography (so called because the same mathematical key is used to encrypt and decrypt the data). Authenticity is achieved by the functions of user identification, data integrity, and message non-repudiation. These are best achieved via asymmetric (or public-key) cryptography.

In particular, public-key cryptography enables encrypted communication between users that have not previously established a shared secret key between them. This is most often done using a combination of symmetric and asymmetric cryptography: public-key techniques are used to establish user identity and a common symmetric key, and a symmetric encryption algorithm is used for the encryption and decryption of the actual messages. The former operation is called key agreement. Prior establishment is necessary in symmetric cryptography, which uses algorithms for which the same key is used to encrypt and decrypt a message. Public-key cryptography, in contrast, is based on key pairs. A key pair consists of a private key and a public key. As the names imply, the private key is kept private by its owner, while the public key is made public (and typically associated to its owner in an authenticated manner). In asymmetric encryption, the encryption step is performed using the public key, and decryption using the private key. Thus the encrypted message can be sent along an insecure channel with the assurance that only the intended recipient can decrypt it.

The key agreement can be interactive (e.g., for encrypting a telephone conversation) or non-interactive (e.g., for electronic mail).

User identification is most easily achieved using what are called identification protocols. A related technique, that of digital signatures, provides data integrity and message non-repudiation in addition to user identification.

The public key is used for encryption or signature verification of a given message, and the private key is used for decryption or signature generation of the given message.

The use of cryptographic key pairs was disclosed in U.S. Pat. No. 4,200,770, entitled “CRYPTOGRAPHIC APPARATUS AND METHOD.” Also disclosed is the application of key pairs to the problem of key agreement over an insecure communication channel. The algorithms specified in the patent rely for their security on the difficulty of the mathematical problem of finding a discrete logarithm. U.S. Pat. No. 4,200,770 is incorporated herein in its entirety by reference.

In order to undermine the security of a discrete-logarithm based crypto algorithm, an adversary must be able to perform the inverse of modular exponentiation (i.e., a discrete logarithm). There are mathematical methods for finding a discrete logarithm (e.g., the Number Field Sieve), but these algorithms cannot be done in any reasonable time using sophisticated computers if certain conditions are met in the specification of the crypto algorithm.

In particular, it is necessary that the numbers involved be large enough. The larger the numbers used, the more time and computing power is required to find the discrete logarithm and break the cryptograph. On the other hand, very large numbers lead to very long public keys and transmissions of cryptographic data. The use of very large numbers also requires large amounts of time and computational power in order to perform the crypto algorithm. Thus, cryptographers are always looking for ways to minimize the size of the numbers involved, and the time and power required, in performing the encryption and/or authentication algorithms. The payoff for finding such a method is that cryptography can be done faster, cheaper, and in devices that do not have large amounts of computational power (e.g., hand-held smart-cards).

A discrete-logarithm based crypto algorithm can be performed in any mathematical setting in which certain algebraic rules hold true. In mathematical language, the setting must be a finite cyclic group. The choice of the group is critical in a cryptographic system. The discrete logarithm problem may be more difficult in one group than in another for which the numbers are of comparable size. The more difficult the discrete logarithm problem, the smaller the numbers that are required to implement the crypto algorithm. Working with smaller numbers is easier and faster than working with larger numbers. Using small numbers allows the cryptographic system to be higher performing (i.e., faster) and requires less storage. So, by choosing the right kind of group, a user may be able to work with smaller numbers, make a faster cryptographic system, and get the same, or better, cryptographic strength than from another cryptographic system that uses larger numbers.

1.1 Elliptic Curves & Cryptography

The groups referred to above come from a setting called finite fields. Methods of adapting discrete-logarithm based algorithms to the setting of elliptic curves are known. However, finding discrete logarithms in this kind of group is particularly difficult. Thus elliptic curve-based crypto algorithms can be implemented using much smaller numbers than in a finite-field setting of comparable cryptographic strength. Thus the use of elliptic curve cryptography is an improvement over finite-field based public-key cryptography.

In practice, an Elliptic Curve group over a finite field F is formed by choosing a pair of a and b coefficients, which are elements within F. The group consists of a finite set of points P(x,y) which satisfy the elliptic curve equation F(x,y)=y ² −x ³ −ax−b=0  1.1

-   -   together with a point at infinity, O. It is worth noting that an         elliptic curve equation contains one cubic variable termed the         x-coordinate and one quadratic variable termed the y-coordinate.         The coordinates of the point, x and y, are elements of F         represented in N-bit strings. In what follows, a point is either         written as a capital letter, e.g. P, or as a pair in terms of         the affine coordinates, i.e. (x,y).

The Elliptic Curve Cryptosystem relies upon the difficulty of the Elliptic Curve Discrete Logarithm Problem (ECDLP) to provide its effectiveness as a cryptosystem. Using multiplicative notation, the problem can be described as: given points B and Q in the group, find a number k such that B^(k)=Q; where k is called the discrete logarithm of Q to the base B. Using additive notation, the problem becomes: given two points B and Q in the group, find a number k such that kB=Q.

In an Elliptic Curve Cryptosystem, the large integer k is kept private and is often referred to as the secret key. The point Q together with the base point B are made public and are referred to as the public key. The security of the system, thus, relies upon the difficulty of deriving the secret k, knowing the public points B and Q. The main factor that determines the security strength of such a system is the size of its underlying finite field. In a real cryptographic application, the underlying field is made so large that it is computationally infeasible to determine k in a straightforward way by computing all the multiples of B until Q is found.

The core of the elliptic curve geometric arithmetic is an operation called scalar multiplication which computes kB by adding together k copies of the point B. The scalar multiplication is performed through a combination of point-doubling and point-addition operations. The point-addition operation adds two distinct points together and the point-doubling operation adds two copies of a point together. To compute, for example, 11 B=(2*(2*(2B)))+2B=Q, it would take 3 point-doublings and 2 point-additions.

Addition of two points on an elliptic curve is calculated as follows. When a straight line is drawn through the two points, the straight line intersects the elliptic curve at a third point. The point symmetric to this third intersecting point with respect to the x-axis is defined as a point resulting from the addition.

Doubling a point on an elliptic curve is calculated as follows. When a tangent line is drawn at a point on an elliptic curve, the tangent line intersects the elliptic curve at another point. The point symmetric to this intersecting point with respect to the x-axis is defined as a point resulting from the doubling.

Table 1 illustrates the addition rules for adding two points (x₁,y₁) and (x₂,y₂) that is, (x ₃ ,y ₃)=(x ₁ ,y ₁)+(x ₂ ,y ₂)  1.2 TABLE 1 Summary of Addition Rules: (x₃, y₃) = (x₁, y₁) + (x₂, y₂) General Equations x₃ = m² − x₂ − x₁ y₃ = m (x₃ − x₁) + y₁ Point Addition $m = \frac{y_{2} - y_{1}}{x_{2} - y_{1}}$ Point Doubling (x₃, y₃) = 2(x₁, y₁) $m = \frac{{3x_{1}^{2}} - \alpha}{2y_{1}}$ (x₂, y₂) = −(x₁, y₁) (x₃, y₃) = (x₁, y₁) + (−(x₂, y₂)) = O (x₂, y₂) = O (x₃, y₃) = (x₁, y₁) + O = (x₁, y₁) −(x₁, y₁) =(x₁, −y₁) 1.2 Overview of Elliptic Curve Encryption and Decryption

Given a message point (x_(m),y_(m)), a base point (x_(B),y_(B)), and a given key, k, the cipher point (x_(C),y_(C)) is obtained using the following equation, (x _(C) ,y _(C))=(x _(m) ,y _(m))+k(x _(B) ,y _(B))  1.3

There are two basics steps in the computation of the above equations. The first is to find the scalar multiplication of the base point with the key, “k(x_(B),y_(B))”. The resulting point is then added to the message point, (x_(m),y_(m)) to obtain the cipher point.

At the receiver, the message point is recovered from the cipher point which is usually transmitted, the shared key and the base point, that is (x _(m) ,y _(m))=(x _(C) ,y _(C))−k(x _(B) ,y _(B))  1.4 1.3 Embedding Message Data on Elliptic Curve Points

As indicated earlier, the x-coordinate, x_(m), is represented as an N-bit string. Not all of the N-bits are used to carry information about the data of the secret message.

Assuming that the number of bits of the x-coordinate, x_(m), that do not carry data is L. The extra bits, L, are used to ensure that message data when embedded into the x-coordinate will lead to an x_(m) value that satisfies the elliptic curve equation, equation 1.1. Usually, if the first guess of x_(m) is not on a curve, then the second or third try is. This was first proposed in “N. Kobltiz, Introduction to Elliptic Curve and Modular Forms, New York: Springer-Verlag 1993”.

Therefore the number of bits used to carry the bits of the message data is (N−L). Assuming that the secret data is a K-bit string. The number of elliptic curve points needed to encrypt the K-bit data is $\left\lceil \frac{K}{N - L} \right\rceil.$

It is important to note that the y-coordinate, y_(m), of the message point carries no data bits.

1.4 Attacks

The difficulty in solving the elliptic curve discrete logarithm problem has been established theoretically while information associated with secret information such as the private key or the like may leak out in cryptographic processing in real mounting. Thus, there has been proposed an attack method of so-called power analysis in which the secret information is decrypted on the basis of the leak information.

An attack method in which change in voltage is measured in cryptographic processing using secret information such as DES (Data Encryption Standard) or the like, so that the process of the cryptographic processing is obtained and the secret information is inferred on the basis of the obtained process is disclosed in P. Kocher, J. Jaffe and B. Jun Differential Power Analysis, Advances in Cryptology: Proceedings of CRYPTO '99, LNCS 1666, Springer-Verlag, (1999) pp. 388-397. This attack method is called DPA (Differential Power Analysis).

An elliptic curve cryptosystem to which the above-mentioned attack method is applied is disclosed in J. Coron, Resistance against Differential Power Analysis for Elliptic Curve Cryptosystems, Cryptographic Hardware and Embedded Systems: Proceedings of CHES '99, LNCS 1717, Springer-Verlag, (1999) pp. 292-302. In the elliptic curve cryptosystem, encryption, decryption, signature generation and signature verification of a given message have to be carried out with elliptic curve operations. Particularly, calculation of scalar multiplication on an elliptic curve is used in cryptographic processing using a scalar value as secret information.

As one of the measures against DPA attack on elliptic curve cryptosystems, a method using randomized projective coordinates is known. This is a measure against an attack method of observing whether a specific value appears or not in scalar multiplication calculation, and inferring a scalar value from the observing result. That is, by multiplication with a random value, the appearance of such a specific value is prevented from being inferred.

In the above-mentioned background-art elliptic curve cryptosystem, attack by power analysis such as DPA or the like was not taken into consideration. Therefore, to relieve the attack by power analysis, extra calculation, or the like, other than necessary calculation had to be carried out using secret information to weaken the dependence of the process of the cryptographic processing and the secret information on each other. Thus, time required for the cryptographic processing increased so that cryptographic processing efficiency was lowered particularly in a computer such as an IC card, or the like, which was slow in calculation speed, a server managing an enormous number of cryptographic processes, or the like. In addition, the dependence of cryptographic processing process and secret information on each other cannot be cut off perfectly. In addition, if priority was given to the cryptographic processing efficiency, the cryptosystem was apt to come under attack by power analysis so that there was a possibility that secret information would leak out.

1.5 Speed of Computations

With the development of information communication networks, cryptographic techniques have been indispensable elements for concealment or authentication about electronic information. Speeding up is demanded along with the security of the cryptographic techniques. The elliptic curve discrete logarithm problem is so difficult that elliptic curve cryptosystems can make key length shorter than that in RSA (Rivest-Shamir-Adleman) cryptosystems basing their security on the difficulty of factorization into prime factors. Thus, the elliptic curve cryptosystems open the way to comparatively high-speed cryptographic processing. However, the processing speed is not always high enough to satisfy smart cards which have restricted throughput or servers which have to carry out large volumes of cryptographic processing. It is therefore demanded to further speed up the processing in cryptosystems.

The two equations for m in Table 1 are called slope equations. Computation of a slope equation in finite fields requires one finite field division. Alternatively, the slope computation can be computed using one finite field inversion and one finite field multiplication. Finite field division and finite field inversion are expensive computationally because they require extensive CPU cycles for the manipulation of two elements of a finite field with a large order. Today, it is commonly accepted that a point-doubling and point-addition operation each requires one inversion, two multiplies, a square, and several additions. To date there are techniques to compute finite field division and finite field inversion, and techniques to trade expensive inversions for multiplications by performing the operations in projective coordinates.

In cases where field inversions are significantly more expensive than multiplication, it is efficient to implement projective coordinates. An elliptic curve projective point (X,Y,Z) in conventional projective (or homogeneous) coordinates satisfies the homogeneous Weierstrass equation, {tilde over (F)}(X,Y,Z)=Y ² Z−X ³ −aXZ ² −bZ ³=0  1.5

-   -   and, when z≠0, it corresponds to the affine point         $\left( {x,y} \right) = {\left( {\frac{X}{Z},\frac{Y}{Z}} \right).}$     -    It turns out that other projective representations lead to more         efficient implementations of the group operation. In particular,         the Jacobian representations where the triplets (X,Y,Z)         corresponds to the affine coordinates         $\left( {x,y} \right) = \left( {\frac{X}{Z^{2}},\frac{Y}{Z^{3}}} \right)$     -    whenever z≠0. This is equivalent to using Jacobian elliptic         curve equation that is of the form,         {tilde over (F)} _(J)(X,Y,Z)=Y ² −X ³ −aXZ ⁴ −bZ ⁶=0  1.6

Another commonly used projection is the Chudnovsky-Jacobian coordinates.

In general terms, the relationship between the affine coordinates and the projection coordinates can be written as $\left( {x,y} \right) = \left( {\frac{X}{Z^{i}},\frac{Y}{Z^{j}}} \right)$ where the values of i and j depend on the choice of the projective coordinates. For example for homogeneous coordinates, i=1 and j=1.

The use of projective coordinates circumvents the need for division in the computation of each point addition and point doubling during the calculation of scalar multiplication. Therefore, finite field division can be avoided in the calculation of scalar multiplication, $k\left( {\frac{X_{B}}{Z_{B}^{i}},\frac{Y_{B}}{Z_{B}^{j}}} \right)$ when using projective coordinate.

The last addition for the computation of the cipher point, $\left( {\frac{X_{C}}{Z_{C}^{i}},\frac{Y_{C}}{Z_{C}^{j}}} \right),$ i.e. the addition of the two points $\left( {\frac{X_{m}}{Z_{m}^{i}},\frac{Y_{m}}{Z_{m}^{j}}} \right)\quad{and}\quad{k\left( {\frac{X_{B}}{Z_{B}^{i}},\frac{Y_{B}}{Z_{B}^{j}}} \right)}$ can also be carried out in the chosen projection coordinate, that is $\left( {\frac{X_{C}}{Z_{C}^{i}},\frac{Y_{C}}{Z_{C}^{j}}} \right) = {\left( {\frac{X_{m}}{Z_{m}^{i}},\frac{Y_{m1}}{Z_{m}^{j}}} \right) + \left( {\frac{X_{B}}{Z_{B}^{i}},\frac{Y_{B}}{Z_{B}^{j}}} \right)}$

It should be pointed out that Z_(m)=1.

However, one division (or one inversion and one multiplication) must still be carried out to calculate ${x_{C} = \frac{X_{C}}{Z_{C}^{i}}},$ since only the affine x-coordinate of the cipher point, x_(C), is sent by the sender.

Therefore the encryption of (N−L) bits of the secret message using elliptic curve encryption requires at least one division when using projective coordinates. Similarly, the decryption of a single message encrypted using elliptic curve cryptography also requires at least one division when using projective coordinates.

The state of elliptic curve cryptography is described in a paper by Neal Koblitz, Alfred Meneges and Scott Vanstone, Design, Codes and Cryptography 19 173-193 (2000) which is incorporated herein in its entirety by reference. More recent developments are described in the U.S. patent of Vanstone et al. U.S. Pat. No. 6,424,712 and the published patent applications U.S. 2003/0059042 of Okeya et al., No. 2003/0123656 of Izu et al. and 2003/0142820 of Futa et al. all of which are incorporated herein by reference. An earlier patent number 4,200,770 of Hellman et al. discloses an earlier cryptographic apparatus and method and is also incorporated herein by reference.

The 0059042, 0123656 and 0142820 patent applications and U.S. application number 6,424,712 address the issue of speeding up elliptic curve scale multiplications.

LIST OF FIGURES

FIG. 1: Shows the elliptic points obtained using y₀ ²=x₀ ³+x₁ ³+x₀x₁. It should be noted that the points in the x₀y plane are connected to illustrate the shape of the resulting surface.

FIG. 2: Shows the elliptic points obtained using y₀ ²+x₀x₁y₀+y₀=x₀ ³+x₁ ³+x₀ ²x₁+x₀x₁ ²+x₀x₁+x₀+x₁. It should be noted that the points in the x₀y plane are connected to illustrate the shape of the resulting surface.

2 BRIEF SUMMARY OF THE INVENTION

In essence, the present invention contemplates an improved method for communicating securely over an insecure channel using elliptic polynomial cryptography defined over a finite field F. The improvement comprises using more than one cubic variable to obtain an elliptic polynomial equation with multi cubic variables instead of one cubic variable that is used in conventional elliptic curve cryptography. The additional cubic variables are used to embed extra message data bits in a single elliptic point which satisfies an elliptic polynomial equation with multi cubic variables.

The cubic variables are termed the x-coordinates in this invention.

Given that nx additional x-coordinates are used with nx greater or equal to one, a resulting elliptic point has (nx+1) x-coordinates wherein all coordinates of such points are elements of a finite field F. The number of points that satisfy an elliptic polynomial equation with nx additional x-coordinates defined over F and which can be used in the corresponding cryptosystem is increased by a factor of (#F)^(nx), where # denotes the size of a field.

A nx-fold increase in the number of embedded message data bits in a single elliptic point can be achieved when embedding extra message data bits in the additional nx x-coordinates. The increase in the embedded message data bits in the improved method is achieved without any increase in the complexity of the underlying finite field arithmetic, because the addition of any two of the resulting elliptic points is defined over an extended dimensional space that incorporates the additional nx x-coordinates and wherein this addition is computed using arithmetic over a finite filed F.

Projective coordinates are used to remove an inversion or division operation at each iteration and for randomizing the computation in order to provide a counter measure against differential power analysis.

New methods for shared key cryptography and public key cryptography as well as digital signature generation and verification are also disclosed in this invention based on the invention of using an elliptic polynomial equation with more than one x-coordinate.

In the classical approach of elliptic curve cryptography, encryption and decryption, an elliptic curve point is represented using one x-coordinate (i.e. one cubic variable) and one y-coordinate (i.e. one quadratic variable) and wherein the message data bits are embedded in the x-coordinate only. Furthermore, given an elliptic curve defined over F that needs N-bit for the representation of its elements, the x-coordinate carries only (N−L) bits of the message data bits. Therefore, at least one inversion or division over F is needed per (N−L)-bit encryption.

In this invention, a new approach to elliptic polynomial cryptography is presented where the encryption of more than (N−L)-bits of the message data is achieved per one inversion or division over F.

This is achieved by defining an elliptic point addition over an extended dimensional space by using more than one x-coordinate (cubic variable) in an elliptic polynomial equation rather than a single x-coordinate (cubic variable). The use of multi x-coordinates allows the embedding of extra message data bits in the additional x-coordinates of an elliptic point, where all the coordinates of such points are elements of F represented in N-bit strings. In the new invention, necessary bits needed to recover all the coordinates of the cipher point are sent to the receiver.

At the receiving entity, all the message data bits are recovered from the relevant coordinates of the cipher point using one inversion or division over F.

In the proposed invention, projective coordinate is used at the sending and receiving entities to eliminate the inversion or division during each point addition and doubling operations of the scalar multiplication.

In theory, up to n×N extra message data bits can be embedded in a single elliptic point when using additional nx x-coordinates, with nx greater or equal to one, and wherein all the message data bits can be encrypted and subsequently decrypted using one inversion or division.

The embedding of extra message data bits in the additional x-coordinates of an elliptic point results in a significant reduction in the complexity of the underlying finite field arithmetic while maintaining the same level of security. The reason is that the number of points that satisfy an elliptic polynomial equation with nx additional x-coordinates, with nx greater or equal to one, and which can be used in the corresponding cryptosystem is increased by a factor of (#F)^(nx), where # denotes the size of a field. Hence, for the same number of embedded bits, a smaller F can be used when embedding in elliptic points with more than one x-coordinate than when embedding in elliptic points with only one x-coordinate.

An encryption and decryption method which embeds extra message data bits in a projective coordinate in addition to the extra message data bits that are embedded in the additional nx x-coordinates and wherein the addition of the corresponding elliptic points is defined over the extended dimensional space that incorporates the additional nx x-coordinates and the projective coordinate is also disclosed.

DESCRIPTION OF THE PREFERRED EMBODIMENTS OF THE INVENTION

3 Definition of Ibrahim's Equation

The degree of a variable u^(i) is meant to be i. A polynomial is the sum of several terms which are called monomials. The total degree of a monomial u^(i)v^(j)w^(k) is meant to be (i+j+k).

It is well known that the symbol E denotes set membership.

As disclosed herein, one form of Ibrahim's elliptic polynomial equation with more than one x-coordinate is defined as follows:

It is a polynomial with more than two independent variables such that:

-   -   1 the maximum total degree of any monomial in the polynomial is         three,     -   2 at least two variables, termed the x-coordinates, have a         maximum degree of three, and each must appear in one of the         monomials with a degree of three,     -   3 at least one variable, termed the y-coordinate, has a maximum         degree of two, and must appear in one of the monomials on its         own with a degree of two.

In order to illustrate some of the preferred embodiments of how to exploit more than one x-coordinate (cubic variable), it is assumed in the following that an elliptic polynomial equation contains (nx+1) x-coordinates and (ny+1) y-coordinates, wherein nx is greater than or equal to one, and ny is greater than or equal to zero.

Letting S_(nx) represents the set of numbers from 0 to nx, i.e. S_(nx)={0, . . . ,nx}, and letting S_(ny) represents the set of numbers from 0 to ny, i.e. S_(ny)={0, . . . ,ny}. Given a finite field, F, the following equation defined over F is one example of the polynomial described above, $\begin{matrix} {{{\sum\limits_{k \in S_{ny}}{a_{1k}y_{k}^{2}}} + {\sum\limits_{k,{l \in S_{ny}},{l \neq k}}{a_{2{kl}}y_{k}y_{l}}} + {\sum\limits_{k \in S_{ny}}{a_{3k}y_{k}}} + {\sum\limits_{k,{l \in S_{ny}},{i \in S_{nx}}}{c_{1{kli}}y_{k}y_{l}x_{i}}} + {\sum\limits_{{k \in S_{ny}},{l \in S_{nx}}}{c_{2{kl}}y_{k}x_{l}}} + {\sum\limits_{{k \in S_{ny}},l,{i \in S_{nx}}}{c_{3{kli}}y_{k}x_{l}x_{i}}}} = {{\sum\limits_{l \in S_{nx}}{b_{1l}x_{l}^{3}}} + {\sum\limits_{l,{k \in S_{nx}},{l \neq k}}{b_{2{lk}}x_{l}^{2}x_{k}}} + {\sum\limits_{l,{k \in S_{nx}}}{b_{3{lk}}x_{l}x_{k}}} + {\sum\limits_{k \in S_{nx}}{b_{4k}x_{k}}} + b_{c}}} & 3.1 \end{matrix}$ where a_(1l),a_(2kl),a_(3k),c_(1lki),c_(2kl),c_(3kli),b_(1l),b_(2lk),b_(3lk),b_(4k) & b_(c)∈F.

Two possible examples of equation 3.1 are given below: y ₀ ² =x ₀ ³ +x ₁ ³ +x ₀ x ₁  3.2 y ₀ ² +x ₀ x ₁ y ₀ +y ₀ =x ₀ ³ x ₁ ³ +x ₀ ² x ₁ +x ₀ x ₁ ² +x ₀ x ₁ +x ₀ +x ₁  3.3

FIGS. 1 and 2 show the elliptic points obtained from equations 3.2 and 3.3 respectively. It should be noted that the points in the x₀y plane are connected to illustrate the shape of the resulting surface.

4 Use of Ibrahim Equation in the Definition of Addition of Points of an Elliptic Polynomial with Multi x-Coordinates:

Given specific coefficients a_(1k),a_(2kl),a_(3k),c_(1lki),c_(2kl),c_(3kli),b_(1l),b_(2lk),b_(3lk),b_(4k) & b_(c)∈F in equation 3.1, one can define the set of points EC^(nx+ny+2) as the (nx+ny+2)-tuple (x₀ ,x₁, . . . ,x_(nx),y₀,y₁, . . . ,y_(ny)), where x_(i),y_(k)∈F, i∈S_(nx) and k∈S_(ny),

-   -   (i) that are solutions of equation 3.1 but excluding the point         (0,0, . . . ,0), plus     -   (ii) the point at infinity, (x_(0,I),x_(1,I), . . .         ,x_(nx,I),y_(0,I),y_(1,I), . . . ,y_(ny,I))

The rules for the conventional elliptic curve point addition can be adopted to define an additive binary operation, +, over EC^(nx+ny+2). That is for all

-   (x_(0,1),x_(1,1), . . . ,x_(nx,1),y_(0,1),y_(1,1), . . .     ,y_(ny,1))∈EC^(nx+ny+2) and -   (x_(0,2),x_(1,2), . . . ,x_(nx,2),y_(0,2),y_(1,2), . . .     ,y_(ny,2))∈EC^(nx+ny+2), the sum,     (x _(0,3) ,x _(1,3) , . . . ,x _(nx,3) ,y _(0,3) ,y _(1,3) , . . .     ,y _(ny,3))=(x _(0,1) ,x _(1,1) , . . . ,x _(nx,1) ,y _(0,1) ,y     _(1,1) , . . . ,y _(ny,1))+(x _(0,2) ,x _(1,2) , . . . ,x _(nx,2) ,y     _(0,2) ,y _(1,2) , . . . ,y _(ny,2))  4.1     is also (x_(0,3),x_(1,3), . . . ,x_(nx,3),y_(0,3),y_(1,3), . . .     ,y_(ny,3))∈EC^(nx+ny+2).

It is shown in this invention that (EC^(nx+ny+2), +) forms a pseudo-group (P-group) over addition that satisfies the following axioms:

-   (i) There exists (x_(0,I),x_(1,I), . . . ,x_(nx,I),y_(0,I),y_(1,I),     . . . ,y_(ny,I))∈EC^(nx+ny+2) such that (x₀,x₁, . . . ,x_(nx),y₀,y₁,     . . . ,y_(ny))+(x_(0,I),x_(1,I), . . . ,x_(nx,I),y_(0,I),y_(1,I), .     . . ,y_(ny,I))=(x_(o),x₁, . . . ,x_(nx),y₀,y₁, . . . ,y_(ny)) for     all (x ₀,x₁, . . . ,x_(nx)y₀,y₁, . . . ,y_(ny))∈EC^(nx+ny+2), -   (ii) For every (x₀,x₁, . . . ,x_(nx),y₀,y₁, . . .     ,y_(ny))∈EC^(nx+ny+2) there exists an inverse −(x₀,x₁, . . .     ,x_(nx),y₀,y₁, . . . ,y_(ny))∈EC^(nx+ny+2) such that (x₀,x₁, . . .     ,x_(nx),y₀,y₁, . . . ,y_(ny))−(x₀,x₁, . . . ,x_(nx),y₀,y₁, . . .     ,y_(ny))=(x_(0,I),x_(1,I), . . . ,x_(nx,I),y_(0,I),y_(1,I), . . .     ,y_(ny,I)) -   (iii) The additive binary operation in (EC^(nx+ny+2), +) is     commutative. The p-group (EC^(nx+ny+2), +) forms a group over     addition when: -   (iv) The additive binary operation in (EC^(nx+ny+2), +) is     associative.     Before discussing these axioms, the concept of point equivalence is     described first.     4.1 Point Equivalence

Mappings can be used to indicate that an elliptic point represented using multi x-coordinates is equivalent to one or more elliptic points that satisfy the same elliptic polynomial equation, including the equivalence of an elliptic point to itself.

Points that are equivalent to each other can be substituted for each other at random or according to certain rules during point addition and/or point doubling operations. For example when using (nx+1) x-coordinates and (ny+1) y-coordinates, the addition of two points (x_(0,1),x_(1,1), . . . ,x_(nx,1),y_(0,1),y_(1,1), . . . ,y_(ny,1)) & (x_(0,2),x_(1,2), . . . ,x_(nx,2),y_(0,2),y_(1,2), . . . ,y_(ny,2)) is given by,

-   (x_(0,3),x_(1,3), . . . ,x_(nx,3),y_(0,3),y_(1,3), . . .     ,y_(ny,3))=(x_(0,1),x_(1,1), . . . ,x_(nx,1),y_(0,1),y_(1,1), . . .     ,y_(ny,1))+(x_(0,2),x_(1,2), . . . ,x_(nx,2),y_(0,2),y_(1,2), . . .     ,y_(ny,2))

If the point (x″_(0,1),x″_(1,1), . . . ,x″_(nx,1),y″_(0,1),y″_(1,1), . . . ,y″_(ny,1))is equivalent to the point (x_(0,1),x_(1,1), . . . ,x_(nx,1),y_(0,1),y_(1,1), . . . ,y_(ny,1)) the former can be substituted for (x_(0,1),x_(1,1), . . . ,x_(nx,1),y_(0,1),y_(1,1), . . . ,y_(ny,1)) in the above equation to obtain

-   (x_(0,3),x_(1,3), . . . ,x_(nx,3),y_(0,3),y_(1,3), . . .     ,y_(ny,3))=(x″_(0,1),x″_(1,1), . . . ,x″_(nx,1),y″_(0,1),y″_(1,1), .     . . ,y″_(ny,1))+(x_(0,2),x_(1,2), . . . ,x_(nx,2),y_(0,2),y_(1,2), .     . . ,y_(ny,2))

Mappings that are used to define equivalences can be based on certain properties that can exist in elliptic polynomial equations such as symmetry between variables. As an example, consider the point (x₀,x₁,y₀) that satisfies the equation y₀ ²=x₀ ³+x₁ ³+x₀x₁. The equivalent of this point could be defined as (x₁,x₀,−y₀)

4.2 Definition of the Addition Rules for (EC^(nx+ny+2), +):

Addition of two points (x_(0,1),x_(1,1), . . . ,x_(nx,1),y_(0,1),y_(1,1), . . . ,y_(ny,1))∈EC^(nx+ny+2) and (x_(0,2),x_(1,2), . . . ,x_(nx,2),y_(0,2),y_(1,2), . . . ,y_(ny,2))∈EC^(nx+ny+2), (x _(0,3) ,x _(1,3) , . . . ,x _(nx,3) ,y _(0,3) ,y _(1,3) , . . . ,y _(ny,3))=(x _(0,1) ,x _(1,1) , . . . ,x _(nx,1) ,y _(0,1) ,y _(1,1) , . . . ,y _(ny,1))+(x _(0,2) ,x _(1,2) , . . . ,x _(nx,2) ,y _(0,2) ,y _(1,2) , . . . ,y _(ny,2))  4.2 is obtained as follows. Draw a straight line that passes through the two points to be added. The straight line intersects EC^(nx+ny+2) at a third point, say (x′_(0,3),x′_(1,3), . . . ,x′_(nx,3),y′_(0,3),y′_(1,3), . . . ,y′_(ny,3))∈EC^(nx+ny+2). The sum point is defined as (x _(0,3) ,x _(1,3) , . . . ,x _(nx,3) ,y _(0,3) ,y _(1,3) , . . . ,y _(ny,3))=−(x′ _(0,3) ,x′ _(1,3) , . . . ,x′ _(nx,3) ,y′ _(0,3) ,y′ _(1,3) , . . . ,y′ _(ny,3))  4.3

It is easy to see from the above definition of the addition rule that addition over EC^(nx+ny+2) is commutative, i.e. (x _(0,1) ,x _(1,1) , . . . ,x _(nx,1) ,y _(0,1) ,y _(1,1) , . . . ,y _(ny,1))+(x _(0,2) ,x _(1,2) , . . . ,x _(nx,2) ,y _(0,2) ,y _(1,2) , . . . ,y _(ny,2))=(x _(0,2) ,x _(1,2) , . . . ,x _(nx,2) ,y _(0,2) ,y _(1,2) , . . . ,y _(ny,2))+(x _(0,1) ,x _(1,1) , . . . ,x _(nx,1) ,y _(0,1) ,y _(1,1) , . . . ,y _(ny,1))  4.4 for all (x_(0,1),x_(1,1), . . . ,x_(nx,1),y_(0,1),y_(1,1), . . . ,y_(ny,1))∈EC^(nx+ny+2) and (x_(0,2),x_(1,2), . . . ,x_(nx,2),y_(0,2),y_(1,2), . . . ,y_(ny,2))∈EC^(nx+ny+2). This satisfies axiom (iii) above.

There are two main cases that need to be considered for the computation of point addition for (EC^(nx+ny+2), +):

-   -   A. For at least one j∈S_(nx), x_(j,1)≠x_(j,2),     -   B. For all j∈S_(nx), x_(j,1)=x_(j,2)=x_(j,o) This has three sub         cases,         -   i. for all k∈S_(ny) y_(k,1)=y_(k,2), i.e.             (x _(0,1) ,x _(1,1) , . . . ,x _(nx,1) ,y _(0,1) ,y _(1,1) ,             . . . ,y _(ny,1))=(x _(0,2) ,x _(1,2) , . . . ,x _(nx,2) ,y             _(0,2) ,y _(1,2) , . . . ,y _(ny,2)),         -    this corresponds to point doubling,         -   ii. for k∈S_(ny) & k≠0, y_(k,1)=y_(k,2), and where y_(0,1) &             y_(0,2) are the roots of the following quadratic equation in             y₀, $\begin{matrix}             {{{a_{10}y_{0}^{2}} + {\sum\limits_{{k \in S_{ny}},{k \neq 0}}{a_{1k}y_{k,1}^{2}}} + {y_{0}\left\{ {{\sum\limits_{{k \in S_{ny}},{k \neq 0}}{a_{2{k0}}y_{k,1}}} + {\sum\limits_{{l \in S_{ny}},{l \neq 0}}{a_{20l}y_{l,1}}}} \right\}} + {\sum\limits_{k,{l \in S_{ny}},{l \neq k},{{{l\&}\quad k} \neq 0}}{a_{2{kl}}y_{k,1}y_{l,1}}} + {a_{30}y_{0}} + {\sum\limits_{{k \in S_{ny}},{k \neq 0}}{a_{3k}y_{k,1}}} + {y_{0}^{2}{\sum\limits_{i \in S_{nx}}{c_{100i}x_{i,1}}}} + {y_{0}\left\{ {{\sum\limits_{{k \in S_{ny}},{i \in S_{nx}}}{c_{1{k0i}}y_{k,1}x_{i,1}}} + {\sum\limits_{{l \in S_{ny}},{i \in S_{nx}}}{c_{10{li}}y_{l,1}x_{i,1}}}} \right\}} + {\sum\limits_{k,{l \in S_{ny}},{{{l\&}\quad k} \neq 0},{i \in S_{nx}}}{c_{1{kli}}y_{k,1}y_{l,1}x_{i,1}}} + {y_{0}{\sum\limits_{l \in S_{nx}}{c_{20l}x_{l,1}}}} + {\sum\limits_{{k \in S_{ny}},{k \neq 0},{l \in S_{nx}}}{c_{2{kl}}y_{k,1}x_{l,1}}} + {y_{0}{\sum\limits_{l,{i \in S_{nx}}}{c_{30{li}}x_{l,1}x_{i,1}}}} + {\sum\limits_{{k \in S_{ny}},{k \neq 0},l,{i \in S_{nx}}}{c_{3{kli}}y_{k,1}x_{l,1}x_{i,1}}}} = {{\sum\limits_{l \in S_{nx}}{b_{1l}x_{l,1}^{3}}} + {\sum\limits_{l,{k \in S_{nx}},{l \neq k}}{b_{2{lk}}x_{l,1}^{2}x_{k,1}}} + {\sum\limits_{l,{k \in S_{nx}}}{b_{3{lk}}x_{l,1}x_{k,1}}} + {\sum\limits_{k \in S_{nx}}{b_{4k}x_{k,1}}} + b_{c}}} & 4.5             \end{matrix}$

This case corresponds to point inverse.

-   -   iii. all other conditions except those in cases B.i & B.ii. This         case occurs only when ny is greater than or equal to one.         Case A For at least one j∈S_(nx) x_(j,1)≠x_(j,2):

A straight line in (nx+ny+2)-dimensional space is defined by, $\begin{matrix} \begin{matrix} {\frac{y_{k} - y_{k,1}}{y_{k,2} - y_{k,1}} = \frac{x_{j} - x_{j,1}}{x_{j,2} - x_{j,1}}} & \quad & \quad & {k \in {S_{ny}\quad{and}\quad j} \in S_{nx}} \end{matrix} & 4.6 \\ {and} & \quad \\ \begin{matrix} {\frac{x_{i} - x_{i,1}}{x_{i,2} - x_{i,1}} = \frac{x_{j} - x_{j,1}}{x_{j,2} - x_{j,1}}} & \quad & \quad & {\quad{{i \neq j},{i \in S_{nx}}}} \end{matrix} & 4.7 \end{matrix}$

In this case, one can write, y _(k) =m _(yk) x _(j) +c _(yk)  4.8 where $\begin{matrix} {m_{yk} = \frac{y_{k,2} - y_{k,1}}{x_{j,2} - x_{j,1}}} & 4.9 \\ {c_{yk} = {y_{k,1} - {x_{j,1}m_{yk}}}} & 4.10 \end{matrix}$

One can also write, x _(i) =m _(xi) x _(j) +c _(xi)  4.11 where $\begin{matrix} {m_{xi} = \frac{x_{i,2} - x_{i,1}}{x_{j,2} - x_{j,1}}} & 4.12 \\ {c_{xi} = {x_{i,1} - {x_{j,1}m_{xi}}}} & 4.13 \end{matrix}$

Equation 3.1 can be written as, $\begin{matrix} {{{\sum\limits_{k \in S_{ny}}{a_{1k}y_{k}^{2}}} + {\sum\limits_{k,{l \in S_{ny}},{l \neq k}}{a_{2{kl}}y_{k}y_{l}}} + {\sum\limits_{k \in S_{ny}}{a_{3k}y_{k}}} + {x_{j}{\sum\limits_{k,{l \in S_{ny}}}{c_{1{klj}}y_{k}y_{l}}}} + {\sum\limits_{k,{l \in S_{ny}},{i \in S_{nx}},{i \neq y}}{c_{1{kli}}y_{k}y_{l}x_{i}}} + {x_{j}{\sum\limits_{k \in S_{ny}}{c_{2{kj}}y_{k}}}} + {\sum\limits_{{k \in S_{ny}},{l \in S_{nx}},{l \neq j}}{c_{2{kl}}y_{k}x_{l}}} + {x_{j}^{2}{\sum\limits_{k \in S_{ny}}{c_{3{kjj}}y_{k}}}} + {x_{j}{\sum\limits_{{k \in S_{ny}},{l \in S_{nx}},{l \neq j}}{c_{3{klj}}y_{k}x_{l}}}} + {x_{j}{\sum\limits_{{k \in S_{ny}},{i \in S_{nx}},{i \neq j}}{c_{3{kji}}y_{k}x_{i}}}} + {\sum\limits_{{k \in S_{ny}},l,{i \in S_{nx}},{{{l\&}\quad i} \neq j}}{c_{3{kli}}y_{k}x_{l}x_{i}}}} = {{b_{1j}x_{j}^{3}} + {\sum\limits_{{l \in S_{nx}},{l \neq j}}{b_{1l}x_{l}^{3}}} + {x_{j}^{2}{\sum\limits_{{k \in S_{nx}},{k \neq j}}{b_{2{jk}}x_{k}}}} + {x_{j}{\sum\limits_{{l \in S_{nx}},{l \neq j}}{b_{2{lj}}x_{l}^{2}}}} + {\sum\limits_{l,{k \in S_{nx}},l,{k \neq j},{l \neq k}}{b_{2{lk}}x_{l}^{2}x_{k}}} + {b_{3{jj}}x_{j}^{2}} + {x_{j}{\sum\limits_{{k \in S_{nx}},{k \neq j}}{b_{3{jk}}x_{k}}}} + {x_{j}{\sum\limits_{{l \in S_{nx}},{l \neq j}}{b_{3{lj}}x_{l}}}} + {\sum\limits_{l,{k \in S_{nx}},l,{k \neq j}}{b_{3{lk}}x_{l}x_{k}}} + {b_{4j}x_{j}} + {\sum\limits_{{k \in S_{nx}},{k \neq j}}{b_{4k}x_{k}}} + b_{c}}} & 4.14 \end{matrix}$

Substituting equations 4.8 & 4.11 for y_(k), k∈S_(ny), and x_(i), i∈S_(nx) & i≠j, in equation 4.14, one obtains, $\begin{matrix} {{{\sum\limits_{k \in S_{ny}}{a_{1k}\left( {{m_{yk}x_{j}} + c_{yk}} \right)}^{2}} + {\sum\limits_{k,{l \in S_{ny}},{l \neq k}}{{a_{2{kl}}\left( {{m_{yk}x_{j}} + c_{yk}} \right)}\quad\left( {{m_{yl}x_{j}} + c_{yl}} \right)}} + {\sum\limits_{k \in S_{ny}}{a_{3k}\left( {{m_{yk}x_{j}} + c_{yk}} \right)}} + {x_{j}{\sum\limits_{k,{l \in S_{ny}}}{{c_{1{klj}}\left( {{m_{yk}x_{j}} + c_{yk}} \right)}\quad\left( {{m_{yl}x_{j}} + c_{yl}} \right)}}} + {\sum\limits_{k,{l \in S_{ny}},{i \in S_{nx}},{i \neq j}}{{c_{1{kli}}\left( {{m_{yk}x_{j}} + c_{yk}} \right)}\quad\left( {{m_{yl}x_{j}} + c_{yl}} \right)\quad\left( {{m_{xi}x_{j}} + c_{xi}} \right)}} + {x_{j}{\sum\limits_{k \in S_{ny}}{c_{2{kj}}\left( {{m_{yk}x_{j}} + c_{yk}} \right)}}} + {\sum\limits_{{k \in S_{ny}},{l \in S_{nx}},{l \neq j}}{{c_{2{kl}}\left( {{m_{yk}x_{j}} + c_{yk}} \right)}\quad\left( {{m_{xl}x_{j}} + c_{xl}} \right)}} + {x_{j}^{2}{\sum\limits_{k \in S_{ny}}{c_{3{kjj}}\left( {{m_{yk}x_{j}} + c_{yk}} \right)}}} + {x_{j}{\sum\limits_{{k \in S_{ny}},{l \in S_{nx}},{l \neq j}}{{c_{3{klj}}\left( {{m_{yk}x_{j}} + c_{yk}} \right)}\left( {{m_{xl}x_{j}} + c_{xl}} \right)}}} + {x_{j}{\sum\limits_{{k \in S_{ny}},{i \in S_{nx}},{i \neq j}}{{c_{3{kji}}\left( {{m_{yk}x_{j}} + c_{yk}} \right)}\left( {{m_{xi}x_{j}} + c_{xi}} \right)}}} + {\sum\limits_{{k \in S_{ny}},l,{i \in S_{nx}},{{{l\&}\quad i} \neq j}}{{c_{3{kli}}\left( {{m_{yk}x_{j}} + c_{yk}} \right)}\left( {{m_{xl}x_{j}} + c_{xl}} \right)\left( {{m_{xi}x_{j}} + c_{xi}} \right)}}} = {{b_{1j}x_{j}^{3}} + {\sum\limits_{{l \in S_{nx}},{l \neq j}}{b_{1l}\left( {{m_{xl}x_{j}} + c_{l}} \right)}^{3}} + {x_{j}^{2}{\sum\limits_{{k \in S_{nx}},{k \neq j}}{b_{2{jk}}\left( {{m_{xk}x_{j}} + c_{xk}} \right)}}} + {x_{j}{\sum\limits_{{l \in S_{nx}},{l \neq j}}{b_{2{lj}}\left( {{m_{xl}x_{j}} + c_{xl}} \right)}^{2}}} + {\sum\limits_{l,{k \in S_{nx}},{{{l\&}\quad k} \neq j},{l \neq k}}{{b_{2{lk}}\left( {{m_{xl}x_{j}} + c_{xl}} \right)}^{2}\left( {{m_{xk}x_{j}} + c_{xk}} \right)}} + {b_{3{jj}}x_{j}^{2}} + {x_{j}{\sum\limits_{{k \in S_{nx}},{k \neq j}}{b_{3{jk}}\left( {{m_{xk}x_{j}} + c_{xk}} \right)}}} + {x_{j}\quad{\sum\limits_{l,{k \in S_{nx}},{l \neq j}}{b_{3{lj}}\left( {{m_{xl}x_{j}} + c_{xl}} \right)}}} + {\sum\limits_{l,{k \in S_{nx}},{{{l\&}\quad k} \neq j}}{{b_{3{lk}}\left( {{m_{xl}x_{j}} + c_{xl}} \right)}\quad\left( {{m_{xk}x_{j}} + c_{xk}} \right)}} + {b_{4j}x_{j +}\quad{\sum\limits_{{k \in S_{nx}},{k \neq j}}{a_{6k}\left( {{m_{xk}x_{j}} + c_{xk}} \right)}}} + b_{c}}} & 4.15 \end{matrix}$

Expanding the terms in equation 4.15 will lead to a cubic equation in x_(j), C ₃ x _(j) ³ +C ₂ x _(j) ² +C ₁ x _(j) +C ₀=0  4.16 where C₃,C₂, C₁ & C₀ can be obtained from equation 4.15 after some algebraic manipulation.

Assuming C₃≠0, the above cubic equation in x_(j) should have three roots x_(j,1), x_(j,2), & x′_(j,3) and can be written in the following form, (x _(j) −x _(j,1))(x _(j) −x _(j,2))(x _(j) −x′ _(j,3))=0  4.17

Normalizing by the coefficient of x³ in equation 4.16, and equating the coefficients of X² in the resulting equation with that in equations 4.17, one obtains a solution for x′_(j,3), $\begin{matrix} {x_{j,3}^{\prime} = {\frac{- C_{2}}{C_{3}} - x_{j,1} - x_{j,2}}} & 4.18 \end{matrix}$

The values of y′_(k,3),k∈S_(ny), and x′_(i,3), i∈S_(nx) & i≠j, can be obtained from equations 4.8 & 4.11 for x_(j)=x′_(j,3).

For cases where C₃=0, equation 4.16 becomes a quadratic equation. Such quadratic equations can be used in the definition of point equivalences.

Case B: For all j∈S_(nx), x_(j,1)=x_(j,2)

There are three sub-cases that are considered below. In all these cases, x_(j,o) is defined as x_(j,o)=x_(j,1)=x_(j,2), j∈S_(nx).

Case B.i. For all k∈S_(ny), y_(k,1)=y_(k,2), which corresponds to Point Doubling:

Clearly, in this case, (x _(0,1) ,x _(1,1) , . . . ,x _(nx,1) ,y _(0,1) ,y _(1,1) , . . . ,y _(ny,1))=(x _(0,2) ,x _(1,2) , . . . ,x _(nx,2) ,y _(0,2) ,y _(1,2) , . . . ,y _(ny,2))

Letting (x _(0,o) ,x _(1,o) , . . . ,x _(nx,o) ,y _(0,o) ,y _(1,o) , . . . ,y _(ny,o))=(x _(0,1) ,x _(1,1) , . . . ,x _(nx,1) ,y _(0,1) ,y _(1,1) , . . . ,y _(ny,1))=(x _(0,2) ,x _(1,2) , . . . ,x _(nx,2) ,y _(0,2) ,y _(1,2) , . . . ,y _(ny,2))

The sum is written as, (x _(0,3) ,x _(1,3) , . . . ,x _(nx,3) ,y _(0,3) ,y _(1,3) , . . . ,y _(ny,3))=(x _(0,o) ,x _(1,o) , . . . ,x _(nx,o) ,y _(0,o) ,y _(1,o) , . . . ,y _(ny,o))+(x _(0,o) ,x _(1,o) , . . . ,x _(nx,o) ,y _(0,o) ,y _(1,o) , . . . ,y _(ny,o))  4.19

There are several ways of defining the addition in this case. Four possible rules are described below.

Case B.i.1: Letting S_(nx,Lx) denote a subset of S_(nx) with Lx elements, i.e. S_(nx,Lx) ⊂S_(nx). Letting S_(ny,Ly) denote a subset of S_(ny) with Ly elements and which does not include the element 0, i.e. S_(ny,Ly⊂S) _(ny) and 0∉S_(ny,Ly). The value of Lx and Ly is at least one. The straight line in this case can be defined as a tangent to the point (x_(0,o),x_(1,o), . . . ,x_(nx,o),y_(0,o),y_(1,o), . . . ,y_(ny,o)) defined in a sub-dimensional space with coordinates y_(n) and x_(m) with n∈S_(ny,Ly) and m∈S_(nx,Lx).

In this case, the gradients m_(yn) and m_(xm) of the straight line to be used in equation 4.18 are basically the first derivatives of y_(n) and x_(m), n∈S_(ny,Ly) and m∈S_(nx,Lx), in equation 3.1 with respect to x_(j), j∈S_(nx,Lx), i.e. $m_{yn} = {{\frac{\mathbb{d}y_{n}}{\mathbb{d}x_{j}}\quad{and}\quad m_{xn}} = {\frac{\mathbb{d}x_{m}}{\mathbb{d}x_{j}}.}}$

Using these derivatives for the values of the gradients, $m_{yn} = \frac{\mathbb{d}y_{n}}{\mathbb{d}x_{j}}$ where n∈S_(ny,Ly) and $m_{xn} = \frac{\mathbb{d}x_{m}}{\mathbb{d}x_{j}}$ where m∈S_(nx,Lx), in equation 4.18 and noting that it is assumed that ${\frac{\mathbb{d}x_{m}}{\mathbb{d}x_{j}} = 0},$ for m∈(S_(nx)−S_(nx,Lx)) and ${\frac{\mathbb{d}y_{n}}{\mathbb{d}x_{j}} = 0},$ for n∈(S_(ny)−S_(ny,Lx)), obtains a solution for x′_(j,3).

The values of y′_(n,3) form n∈S_(ny) and x′_(m,3), for m∈S_(nx) & m≠j, can be obtained from equations 4.8 & 4.11 for x_(j)=x′_(j,3).

The choice of the x_(m)-coordinates, m∈S_(nx,Lx), and y_(n)-coordinates, n∈S_(ny,Ly), that can be used to compute the tangent of the straight line in this case could be chosen at random or according to a certain rule. Also, a different choice of the x_(m)-coordinates, m∈S_(nx,Lx), and y_(n)-coordinates, n∈S_(ny,Ly), can be made when one needs to compute successive point doublings such as that needed in scalar multiplication.

Case B.i.2: The second possible way of defining the addition of a point to itself is to apply a sequence of the point doublings according to the rule defined in Case B.i.1 and where the rule is applied with a different selection of the x-coordinate(s) and y-coordinates(s) in each step of this sequence.

Case B.i.3: Another way is to substitute a point with one of its equivalents. Letting (x_(0,oe),x_(1,oe), . . . ,x_(nx,oe),y_(0,oe),y_(1,oe), . . . ,y_(ny,oe)) represents the equivalent point of (x_(0,o),x_(1,o), . . . ,x_(nx,o),y_(0,o),y_(1,o), . . . ,y_(ny,o)). In this case, equation 4.19 is written as, (x _(0,3) ,x _(1,3) , . . . ,x _(nx,3) ,y _(0,3) ,y _(1,3) , . . . ,y _(ny,3))=(x _(0,o) ,x _(1,o) , . . . ,x _(nx,o) ,y _(0,o) ,y _(1,o) , . . . ,y _(ny,o))+(x _(0,oe) ,x _(1,oe) , . . . ,x _(nx,oe) ,y _(0,oe) ,y _(1,oe) , . . . ,y _(ny,oe))

Case B.i.4: The fourth possible method is to implement point doubling as a sequence of point additions only, (x _(0,3) ,x _(1,3) , . . . ,x _(nx,3) ,y _(0,3) ,y _(1,3) , . . . ,y _(ny,3))=(((x _(0,o) ,x _(1,o) , . . . ,x _(nx,o) ,y _(0,o) ,y _(1,o) , . . . ,y _(ny,o))+(x _(0,R) ,x _(1,R) , . . . ,x _(nx,R) ,y _(0,R) ,y _(1,R) , . . . ,y _(ny,R)))+(x _(0,o) ,x _(1,o) , . . . ,x _(nx,o) ,y _(0,o) ,y _(1,o) , . . . ,y _(ny,o)))−(x _(0,R) ,x _(1,R) , . . . ,x _(nx,R) ,y _(0,R) ,y _(1,R) , . . . ,y _(ny,R)) where (x_(0,R),x_(1,R), . . . ,x_(nx,R),y_(0,R),y_(1,R), . . . ,y_(ny,R))∈EC^(nx+ny+2) is a predetermined reference point.

Case B.ii For k∈S_(ny) & k≠0. y_(k,1)=y_(k,2), and wherein y_(0,1) & y_(0,2) are the roots of the quadratic equation in y₀ given in equation 4.5. This case corresponds to Point Inverse.

Letting y_(k,1)=y_(k,2)=y_(k,0) for k∈S_(ny) & k≠0. Clearly, any two points (x_(0,o),x_(1,o), . . . ,x_(nx,o),y_(0,1),y_(1,o), . . . ,y_(ny,o))∈EC^(nx+ny+2) and (x_(0,o),x_(1,o), . . . ,x_(nx,o),y_(0,2),y_(1,o), . . . ,y_(ny,o))∈EC^(nx+ny+2), are in the hyper plane with x_(i)=x_(i,o),i∈S_(nx) and y_(k)=y_(k,o), k∈S_(ny) & k≠0. Therefore any straight line joining such two points such that (x_(0,o),x_(1,o), . . . ,x_(nx,o),y_(0,1),y_(1,o), . . . ,y_(ny,o))≠(x_(0,o),x_(1,o), . . . ,x_(nx,o),y_(0,2),y_(1,o), . . . ,y_(ny,o)) is also in this hyper plane.

Substituting the values of x_(0,o),x_(1,o), . . . ,x_(nx,o),y_(1,o), . . . , & y_(ny,o) in an elliptic polynomial equation with multi x-coordinate and multi y-coordinates, a quadratic equation for y₀ is obtained as given in equation 4.5. Hence y₀ has only two solutions y_(0,1) & y_(0,2).

Therefore, a line joining the two points (x_(0,o),x_(1,o), . . . ,x_(nx,o),y_(0,1),y_(1,o), . . . ,y_(ny,o))∈EC^(nx+ny+2) & (x_(0,o),x_(1,o), . . . ,x_(nx,o),y_(0,2),y_(1,o), . . . ,y_(ny,o))∈EC^(nx+ny+2) does not intersect with EC^(nx+ny+2) at a third point.

A line that joins such two points is assumed to intersect with EC^(nx+ny+2) at the point of infinity (x_(0,I),x_(1,I), . . . ,x_(nx,I),y_(0,I),y_(1,I), . . . ,y_(ny,I))∈EC^(nx+ny+2). This point at infinity is used to define both the inverse of a point in EC^(nx+ny+2) and the identity point. According to the addition rule defined in section 4. 1, one can write, (x ₀ ,x ₁ , . . . ,x _(nx) ,y _(0,1) ,y ₁ , . . . ,y _(ny))+(x ₀ ,x ₁ , . . . ,x _(nx) ,y _(0,2) ,y ₁ , . . . ,y _(ny))=(x _(0,I) ,x _(1,I) , . . . ,x _(nx,I) ,y _(0,I) ,y _(1,I,) , . . . ,y _(ny,I))  4,20 since the third point of intersection of such lines is assumed to be the point at infinity (x_(0,I),x_(1,I), . . . ,x_(nx,I),y_(0,I),y_(1,I), . . . ,y_(ny,I))∈EC^(nx+ny+2). This equation therefore defines a unique inverse for any point (x_(o),x₁, . . . ,x_(nx),y₀,y₁, . . . . ,y_(ny))∈EC^(nx+ny+2), −(x ₀ ,x ₁ , . . . ,x _(nx) ,y _(0,1) ,y ₁ , . . . ,y _(ny))=(x ₀ ,x ₁ , . . . ,x _(nx) ,y _(0,2) ,y ₁ , . . . ,y _(ny))  4.21

Therefore equation 4.20 can be written as, (x ₀ ,x ₁ , . . . ,x _(nx) ,y _(0,1) ,y ₁ , . . . ,y _(ny))−(x ₀ ,x ₁ , . . . ,x _(nx) ,y _(0,1) ,y ₁ , . . . ,y _(ny))=(x _(0,I) ,x _(1,I) , . . . ,x _(nx,I) ,y _(0,I) ,y _(1,I) , . . . ,y _(ny,I))  4.22

One can also say that a line joining the point at infinity (x_(0,I),x_(1,I), . . . ,x_(nx,I),y_(0,I),y_(1,I), . . . ,y_(ny,I))∈EC^(nx+ny+2) and a point (x₀,x₁, . . . ,x_(nx),y_(0,1),y₁, . . . ,y_(ny))∈EC^(nx+ny+2), will intersect with EC^(nx+ny+2) at (x₀,x₁, . . . ,x_(nx),y_(0,2),y₁, . . . ,y_(ny))∈EC^(nx+ny+2). Therefore, from the addition rule defined in section 4.1, one can also write, (x ₀ ,x ₁ , . . . ,x _(nx) ,y _(0,) ,y ₁ ,y ₂ , . . . ,y _(ny))+(x _(0,I) ,x _(1,I) , . . . ,x _(nx,I) ,y _(0,I) ,y _(1,I) , . . . ,y _(ny,I))=(x ₀ ,x ₁ , . . . ,x _(nx) ,y ₀ ,y ₁ , . . . ,y _(ny))  4.23

Equation 4.22 satisfies axiom (ii) while equation 4.23 satisfies axiom (i) defined in section 4.

Case B.iii All other conditions except those in cases B.i & B.ii. This case occurs only when ny is greater than or equal to one.

Given two points (x_(0,o),x_(1,o), . . . ,x_(nx,o),y_(0,1),y_(1,1), . . . ,y_(ny,1))∈EC^(nx+ny+2) and (x_(0,o),x_(1,o), . . . ,x_(nx,o),y_(0,2),y_(1,2), . . . ,y_(ny,2))∈EC^(nx+ny+2) that do not satisfy the conditions of cases B.i and B.ii above, the sum point is written as, (x _(0,3) ,x _(1,3) , . . . ,x _(nx,3) ,y _(0,3) ,y _(1,3) , . . . ,y _(ny,3))−(x _(0,o) ,x _(1,o) , . . . ,x _(nx,o) ,y _(0,1) ,y _(1,1) , . . . ,y _(ny,1))+(x _(0,o) ,x _(1,o) , . . . ,x _(nx,o) ,y _(0,2) ,y _(1,2) , . . . ,y _(ny,2))

There are several possible rules to find the sum point in this case. Three possible methods are given below:

-   1 Using three point doublings and one point addition,     (x _(0,3) ,x _(1,3) , . . . ,x _(nx,3) ,y _(0,3) ,y _(1,3) , . . .     ,y _(ny,3))=4(x _(0,o) ,x _(1,o) , . . . ,x _(nx,o) ,y _(0,1) ,y     _(1,1) , . . . ,y _(ny,1))−2(x _(0,o) ,x _(1,o) , . . . ,x _(nx,o)     ,y _(0,2) ,y _(1,2) , . . . ,y _(ny,2))  4.24 -   2 Using point additions only,     (x _(0,3) ,x _(1,3) , . . . ,x _(nx,3) ,y _(0,3) ,y _(1,3) , . . .     ,y _(ny,3))=(((x _(0,o) ,x _(1,o) , . . . ,x _(nx,o) ,y _(0,1) ,y     _(1,1) , . . . ,y _(ny,1))+(x _(0,R) ,x _(1,R) , . . . ,x _(nx,R) ,y     _(0,R) ,y _(1,R) , . . . ,y _(ny,R)))+(x _(0,o) ,x _(1,o) , . . . ,x     _(nx,o) ,y _(0,2) ,y _(1,2) , . . . ,y _(ny,2)))−(x _(0,R) ,x _(1,R)     , . . . ,x _(nx,R) ,y _(0,R) ,y _(1,R) , . . . ,y _(ny,R))  4.25     where (x_(0,R),x_(1,R), . . . ,x_(nx,R),y_(0,R),y_(1,R), . . .     ,y_(ny,R))∈EC^(nx+ny+2) is a predetermined reference point. -   3 Using one point doublings and three point additions     (x _(0,3) ,x _(1,3) , . . . ,x _(nx,3) ,y _(0,3) ,y _(1,3) , . . .     ,y _(ny,3))=(2(x _(0,o) ,x _(1,o) , . . . ,x _(nx,o) ,y _(0,1) ,y     _(1,1) , . . . ,y _(ny,1))+(x _(0,o) ,x _(1,o) , . . . ,x _(nx,o) ,y     _(0,2) ,y _(1,2) , . . . ,y _(ny,2)))−(x _(0,o) ,x _(1,o) , . . . ,x     _(nx,o) ,y _(0,1) ,y _(1,1) , . . . ,y _(ny,1))  4.26 -   4 Using point equivalence,     (x _(0,3) ,x _(1,3) , . . . ,x _(nx,3) ,y _(0,3) ,y _(1,3) , . . .     ,y _(ny,3))=(x _(0,o) ,x _(1,o) , . . . ,x _(nx,o) ,y _(0,1) ,y     _(1,1) , . . . ,y _(ny,1))+(x _(0,oe) ,x _(1,oe) , . . . ,x _(nx,oe)     ,y _(0,2e) ,y _(1,2e) , . . . ,y _(ny,2e))  4.27     where (x_(0,oe),x_(1,oe), . . . ,x_(nx,oe),y_(0,2e),y_(1,2e), . . .     ,y_(ny,oe)) is assumed to be the equivalent point of     (x_(0,o),x_(1,o), . . . ,x_(nx,o),y_(0,2),y_(1,2), . . . ,y_(ny,2)).

It is significant to note that the above methods for defining the sum point are not the only ones that can be defined. These only serve as possible examples.

The choice of a method used to obtain the sum point in this case should depend on the computation complexity of point addition and point doubling.

4.3 Associativity of (EC^(nx+ny+2),+):

One way of proving associativity of (EC^(nx+ny+2),+) is as follows. Given particular elliptic polynomial equations (i.e. for particular coefficient's a_(1l),a_(2kl),a_(3k),c_(1lki),c_(2kl),c_(3kli),b_(1l),b_(2lk),b_(3lk),b_(4k) & b_(c)∈F) defined over a finite filed F. If it can be shown by algebra, computations or through other means that (Q+(R+S))=((Q+R)+S) for any three points Q, R, S∈EC^(nx+ny+2), the corresponding (EC^(nx+ny+2),+) based on such polynomials are associative.

4.4 Example of Case A in Point Addition for nx=1 and ny=0:

The following elliptic polynomial equation with nx=1 and ny=0 is used to show an example of the equations in Case A used in point addition, y ₀ ² =x ₀ ³ +x ₁ ³ +x ₀ x ₁  4.27

Choosing x_(j)=x₀, and substituting equation 4.8 for y₀ and equation 4.11 for x₁, in equation 4.27, one obtains, (m _(y0) x ₀ +c _(y0))² =x ₀ ³+(m _(x1) x ₀ +c _(x1))³ +x ₀(m _(x1) x ₀ +c _(x1))

Expanding the terms in brackets one obtains, m _(y0) ² x ₀ ²+2m _(y0) c _(y0) x ₀ +c _(y0) ² =x ₀ ³ +m _(x1) ³ x ₀ ³+3m _(x1) ² c _(x1) x ₀ ²+3m _(x1) c _(x1) ² x ₀ +c _(x1) ³ +m _(x1) x ₀ ² +c _(x1) x ₀ or (1+m _(x1) ³)x ₀ ³+(3m _(x1) ² c _(x1) +m _(x1) −m _(y0) ²)x ₀ ²+(3m _(x1) c _(x1) ² +c _(x1)−2m _(y0) c _(y0))x ₀ +c _(x1) ³ −c _(y0) ²=0  4.28

From equation 4.18, one obtains the solution for x′_(0,3) in this case, $x_{0,3}^{\prime} = {\frac{- \left( {{3m_{x1}^{2}c_{x1}} + m_{x1} - m_{y0}^{2}} \right)}{\left( {1 + m_{x1}^{3}} \right)} - x_{j,1} - x_{j,2}}$

The values of y′_(0,3) and x′_(1,3) can be obtained from equations 4.8 & 4.11 for x₀=x′_(0,3). It is worth noting that when m_(x1)=−1, the coefficient of the cubic term in equation 4.28 is zero, i.e. C₃₌₀. In this case, the resulting quadratic equation can be used in the definition of point equivalences for the points that satisfy equation 4.27.

5 Projective Coordinate

Each of the equations for point addition and point doublings derived for cases A and B in section 4 require modular inversion or division. In cases where field inversions or divisions are significantly more expensive than multiplication, projective coordinates are used to remove the requirement for field inversion or division from these equations as discussed below.

Several projective coordinates can be used. In this invention, the Jacobean projective coordinate is used as an example, viz $\begin{matrix} {x_{i} = {{\frac{X_{i}}{V^{2}}\quad{for}\quad i} \in S_{nx}}} & {5.1.a} \\ {y_{k} = {{\frac{Y_{k}}{V^{3}}\quad{for}\quad k} \in S_{ny}}} & {5.1.b} \end{matrix}$

Using Jacobian projection in equation 3.1, one obtains, $\begin{matrix} {{{\sum\limits_{k \in S_{ny}}{a_{1k}\frac{Y_{k}^{2}}{V^{6}}}} + {\sum\limits_{k,{l \in S_{ny}},{l \neq k}}{a_{2{kl}}\frac{Y_{k}}{V^{3}}\frac{Y_{l}}{V^{3}}}} + {\sum\limits_{k \in S_{ny}}{a_{3k}\frac{Y_{k}}{V^{3}}}} + {\sum\limits_{k,{l \in S_{ny}},{i \in S_{nx}}}{c_{1{kli}}\frac{Y_{k}}{V^{3}}\frac{Y_{l}}{V^{3}}\frac{X_{i}}{V^{2}}}} + {\sum\limits_{{k \in S_{ny}},{l \in S_{nx}}}{c_{2{kl}}\frac{Y_{k}}{V^{3}}\frac{X_{l}}{V^{2}}}} + {\sum\limits_{{k \in S_{ny}},l,{i \in S_{nx}}}{c_{3{kli}}\frac{Y_{k}}{V^{3}}\frac{X_{l}}{V^{2}}\frac{X_{i}}{V^{2}}}}} = {{\sum\limits_{l \in S_{nx}}{b_{1l}\frac{X_{l}^{3}}{V^{6}}}} + {\sum\limits_{l,{k \in S_{nx}},{l \neq k}}{b_{2{lk}}\frac{X_{l}^{2}}{V^{4}}\frac{X_{k}}{V^{2}}}} + {\sum\limits_{l,{k \in S_{nx}}}{b_{3{lk}}\frac{X_{l}}{V^{2}}\frac{X_{k}}{V^{2}}}} + {\sum\limits_{k \in S_{nx}}{b_{4k}\frac{X_{k}}{V^{2}}}} + b_{c}}} & 5.2 \end{matrix}$ which can be rewritten as, $\begin{matrix} {{{\sum\limits_{k \in S_{ny}}{a_{1k}Y_{k}^{2}V^{2}}} + {\sum\limits_{k,{l \in S_{ny}},{l \neq k}}{a_{2{kl}}Y_{k}Y_{l}V^{2}}} + {\sum\limits_{k \in S_{ny}}{a_{3k}Y_{k}V^{5}}} + {\sum\limits_{k,{l \in S_{ny}},{i \in S_{nx}}}{c_{1{kli}}Y_{k}Y_{l}X_{i}}} + {\sum\limits_{{k \in S_{ny}},{l \in S_{nx}}}{c_{2{kl}}Y_{k}X_{l}V^{3}}} + {\sum\limits_{{k \in S_{ny}},l,{i \in S_{nx}}}{c_{3{kli}}Y_{k}X_{l}X_{i}V}}} = {{\sum\limits_{l \in S_{nx}}{b_{1l}X_{l}^{3}V^{2}}} + {\sum\limits_{l,{k \in S_{nx}},{l \neq k}}{b_{2{lk}}X_{l}^{2}X_{k}V^{2}}} + {\sum\limits_{l,{k \in S_{nx}}}{b_{3{lk}}X_{l}X_{k}V^{4}}} + {\sum\limits_{k \in S_{nx}}{b_{4k}X_{k}V^{6}}} + {b_{c}V^{8}}}} & 5.3 \end{matrix}$

In what follows, the points (X₀, X₁, . . . ,X_(nx),Y₀,Y₁, . . . ,Y_(ny),V) are assumed to satisfy equation 5.3.

When V≠0, the projected point (X₀,X₁, . . . ,X_(nx),Y₀,Y₁, . . . ,Y_(ny),V) corresponds to the point, $\left( {x_{0},x_{1},\ldots\quad,x_{nx},y_{0},y_{1},\ldots\quad,y_{ny}} \right) = \left( {\frac{X_{0}}{V^{2}},\frac{X_{1}}{V^{2}},\ldots\quad,\frac{X_{nx}}{V^{2}},\frac{Y_{0}}{V^{3}},\frac{Y_{1}}{V^{3}},\ldots\quad,\frac{Y_{ny}}{V^{3}}} \right)$ which satisfies equation 3.1.

Using Jacobean projective coordinate, equation 4.1 can be written as, $\begin{matrix} {\left( {\frac{X_{0,3}}{V_{3}^{2}},\frac{X_{1,3}}{V_{3}^{2}},\ldots\quad,\frac{X_{{nx},3}}{V_{3}^{2}},\frac{Y_{0,3}}{V_{3}^{3}},\frac{Y_{1,3}}{V_{3}^{3}},\ldots\quad,\frac{Y_{{ny},3}}{V_{3}^{3}}} \right) = {\left( {\frac{X_{0,1}}{V_{1}^{2}},\frac{X_{1,1}}{V_{1}^{2}},\ldots\quad,\frac{X_{{nx},1}}{V_{1}^{2}},\frac{Y_{0,1}}{V_{1}^{3}},\frac{Y_{1,1}}{V_{1}^{3}},\ldots\quad,\frac{Y_{{ny},1}}{V_{1}^{3}}} \right) + \left( {\frac{X_{0,2}}{V_{2}^{2}},\frac{X_{1,2}}{V_{2}^{2}},\ldots\quad,\frac{X_{{nx},2}}{V_{2}^{2}},\frac{Y_{0,2}}{V_{2}^{3}},\frac{Y_{1,2}}{V_{2}^{3}},\ldots\quad,\frac{Y_{{ny},2}}{V_{2}^{3}}} \right)}} & 5.4 \end{matrix}$

By using the Jacobian projective coordinate in the equations of Cases A and B described in section 4 above and by an appropriate choice of the value of V₃, it can be shown that point doubling and point addition can be computed without the need for field inversion or division.

6 Elliptic Polynomial Cryptography with Multi x-Coordinates:

6.1 Symmetric Elliptic Polynomial Cryptography with Multi x-Coordinates:

n symmetric cryptography, a shared secret key or keys are used to encrypt and decrypt the message data bits. One approach of symmetric elliptic polynomial cryptography with multi x-coordinates based on a single shared secret key is carried out as follows:

-   -   1 Both the sending and receiving correspondent agree on the         values of nx & ny, and the set of coefficients         a_(1k),a_(2kl),a_(3k),c_(1lki),c_(2kl),c_(3kli),b_(1l),b_(2lk),b_(3lk),b_(4k)         & b_(c)∈F. They also need to agree on (i) a random number, k,         that will be the shared secret key for communication, and (ii) a         base point, (x_(0,B),x_(1,B), . . . ,x_(nx,B),y_(0,B),y_(1,B), .         . . ,y_(ny,B))∈EC^(xn+ny+2).

The sending correspondent performs the following steps,

-   -   2 Embed the secret message bit string into the (nx+1)         x-coordinates, x₀,x₁, . . . & x_(nx), and the ny y-coordinates,         y₁, . . . & y_(ny), of the elliptic message point,         (x_(0,m),x_(1,m), . . . ,x_(nx,m),y_(0,m),y_(1,m), . . .         ,y_(ny,m))∈EC^(nx+ny+2). A possible method of embedding the         message bits is described in section 6.4.     -   3 Using the shared key, k, and the base point (x_(0,B),x_(1,B),         . . . ,x_(nx,B),y_(0,B),y_(1,B), . . . ,y_(ny,B)) the scalar         multiplication k (x_(0,B),x_(1,B), . . .         ,x_(nx,B),y_(0,B),y_(1,B), . . . ,y_(ny,B)) is computed.     -   4 The cipher point (x_(0,c),x_(1,c), . . .         ,x_(nx,c),y_(0,c),y_(1,c), . . . ,y_(ny,c)) is computed using,         (x _(0,c) ,x _(1,c) , . . . ,x _(nx,c) ,y _(0,c) ,y _(1,c) , . .         . ,y _(ny,c))=(x _(0,m) ,x _(1,m) , . . . ,x _(nx,m) ,y _(0,m)         ,y _(1,m) , . . . ,y _(ny,m))+k(x _(0,B) ,x _(1,B) , . . . ,x         _(nx,B) ,y _(0,B) ,y _(1,B) , . . . ,y _(ny,B))     -   5 The appropriate bits of the x-coordinates, x_(0,c),x_(1,c), .         . . & x_(nx,c), and y-coordinates y_(1,c), . . . & y_(ny,c) of         the cipher point, and if need be any additional information         needed to help recover the message bit string without         compromising security are sent to the receiving correspondent.

At the receiving correspondent, the following steps are performed,

-   -   6 Using the shared key, k, and the base point (x_(0,B),x_(1,B),         . . . ,x_(nx,B),y_(0,B),y_(1,B), . . . ,y_(ny,B)) and any         additional information received from the sending correspondent,         compute the scalar multiplication k(x_(0,B),x_(1,B), . . .         ,x_(nx,B),y_(0,B),y_(1,B), . . . ,y_(ny,B)).     -   7 Compute the message point (x_(0,m),x_(1,m), . . .         ,x_(nx,m),y_(0,m),y_(1,m), . . . ,y_(ny,m)) using,         (x _(0,m) ,x _(1,m) , . . . ,x _(nx,m) ,y _(0,m) ,y _(1,m) , . .         . ,y _(ny,m))=(x _(0,c) ,x _(1,c) , . . . ,x _(nx,c) ,y _(0,c)         ,y _(1,c) , . . . ,y _(ny,c))−k(x _(0,B) ,x _(1,B) , . . . ,x         _(nx,B) ,y _(0,B) ,y _(1,B) , . . . ,y _(ny,B))     -    and using any additional information received from the sending         entity.     -   8 Recover the secret message bit string from the (nx+1)         x-coordinates, x_(0,m),x_(1,m), . . . & x_(nx,m), and the ny         y-coordinates, y_(1,m), . . . & y_(ny,m), and using any         additional information received from the sending entity.         6.2 Public Key Elliptic Polynomial Cryptography with Multi         x-Coordinates:

In public key cryptography, the sending and receiving correspondent use their own private key or keys and public key or keys. In one embodiment, each correspondent uses a single private key, k_(Pr), and a single public key, (x _(0,Pu) ,x _(1,Pu) , . . . ,x _(nx,Pu) ,y _(0,Pu) ,y _(1,Pu) , . . . ,y _(ny,Pu))=k _(Pr)(x _(0,B) ,x _(1,B) , . . . ,x _(nx,B) ,y _(0,B) ,y _(1,B) , . . . ,y _(ny,B))

The sending correspondent uses its private key and the receiving correspondent public key to perform encryption of the secret message bits. The receiving correspondent uses its private key and the sending correspondent public key to perform decryption. Such a public key cryptography method comprises the following steps:

-   -   embedding a message bit string into the (nx+1) x-coordinates,         x₀,x₁, . . . . & x_(n), and the ny y-coordinates, y₁ . . . &         y_(ny), of an elliptic point which is designated as the message         point, (x_(0,m),x_(1,m), . . . ,x_(nx,m),y_(0,m),y_(1,m), . . .         ,y_(ny,m));     -   using the private key of the sending correspondent, k_(SPr), and         the public key of the receiving correspondent,         k_(RPr)(x_(0,B),x_(1,B), . . . ,x_(nx,B),y_(0,B),y_(1,B), . . .         ,y_(ny,B)), to compute the scalar multiplication         (x_(0,bk),x_(1,bk), . . . ,x_(nx,bk),y_(0,bk),y_(1,bk), . . .         ,y_(ny,bk))=k_(S Pr)(k_(R Pr)(x_(0,B),x_(1,B), . . .         ,x_(nx,B),y_(0,B),y_(1,B), . . . ,y_(ny,B))) computing a cipher         point, (x_(0,c),x_(1,c), . . . ,x_(nx,c),y_(0,c),y_(1,c), . . .         ,y_(ny,c)), using         (x _(0,c) ,x _(1,c) , . . . ,x _(nx,c) ,y _(0,c) ,y _(1,c) , . .         . ,y _(ny,c))=(x _(0,m) ,x _(1,m) , . . . ,x _(nx,m) ,y _(0,m)         ,y _(1,m) , . . . ,y _(ny,m))+(x _(0,bk) ,x _(1,bk) , . . . ,x         _(nx,bk) ,y _(0,bk) ,y _(1,bk) , . . . ,y _(ny,bk));     -   sending appropriate bits of the (nx+1) the x-coordinates,         x_(0,c),x_(1,c), . . . & x_(nx,c), and the ny y-coordinates,         y_(1,c), . . . & y_(ny,c), of the cipher point, and if need be         any additional information needed to help the receiving         correspondent recover the message bit string without         compromising security;     -   using the private key of the receiving correspondent, k_(RPr),         and the public key of the sending correspondent,         k_(SPr)(x_(0,B),x_(1,B), . . . ,x_(nx,B),y_(0,B),y_(1,B), . . .         ,y_(ny,B)), and any additional information received from the         sending correspondent, compute the point (x_(0,bk),x_(1,bk), . .         . ,x_(nx,bk),y_(0,bk),y_(1,bk), . . . ,y_(ny,bk)) or its         equivalent,         (x _(0,bke) ,x _(1,bke) , . . . ,x _(nx,bke) ,y _(0,bke) ,y         _(1,bke) , . . . ,y _(ny,bke))=k _(R Pr)(k _(S Pr)(x _(0,B) ,x         _(1,B) , . . . ,x _(nx,B) ,y _(0,B) ,y _(1,B) , . . . ,y         _(ny,B)))         wherein the point (x_(0,bke),x_(1,bke), . . .         ,x_(nx,bke),y_(0,bke),y_(1,bke), . . . ,y_(ny,bke)) is         equivalent to the point (x_(0,bk),x_(1,bk), . . .         ,x_(nx,bk),y_(0,bk),y_(1,bk), . . . ,y_(ny,bk));     -   computing the message point (x_(0,m),x_(1,m), . . .         ,x_(nx,m),y_(0,m),y_(1,m), . . . ,y_(ny,m))using         (x _(0,m) ,x _(1,m) , . . . ,x _(nx,m) ,y _(0,m) ,y _(1,m) , . .         . ,y _(ny,m))=(x _(0,c) ,x _(1,c) , . . . ,x _(nx,c) ,y _(0,c)         ,y _(1,c) , . . . ,y _(ny,c))−(x _(0,bk) ,x _(1,bk) , . . . ,x         _(nx,bk) ,y _(0,bk) ,y _(1,bk) , . . . ,y _(ny,bk))         and any additional information received from the sending         correspondent     -   recovering the message bit string from the (nx+1) x-coordinates,         x_(o,m),x_(1,m), . . . & x_(nx,m), and the ny y-coordinates,         y_(1,m), . . . & y_(ny,m), and using any additional information         received from the sending correspondent.         6.3 Elliptic Polynomial Digital Signature with Multi         x-Coordinates:

All the schemes used for digital signatures that are based on the representation of elliptic points in affine coordinates can be adopted for elliptic polynomial digital signature with multi x-coordinates.

This can be achieved either directly or with some modifications that exploit the additional x-coordinates in generating an elliptic polynomial digital signature with multi x-coordinates.

A conventional elliptic curve digital signature can be basically summarized as follows. A more detailed description can be found in [N.Kobltiz, A. Menezes, S. Vanstone, The state of Elliptic Curve Cryptography, Designs, Codes, and Cryptography, Vol 19, 2000, pp 173-193.]. The entity which generates a signature has a private key, k_(Pr), and a public key, (x_(Pu),y_(Pu))=k_(Pr)(x_(B),y_(B)). Given a message M, the entity generating the signature performs the following steps,

-   1 select a random integer, k, mod p, -   2 compute (x₁,y₁)=k(x_(B),y_(B)) and convert x, into an integer r     mod p, -   3 compute a message digest, digest(M), which is a bit string that is     dependant on the message, and convert the bit string into an integer     e, -   4 compute s=k⁻(e+k_(Pr)r) mod p, -   5 signature of the message M is (r,s).

The signature is verified at the receiving entity using the following steps,

-   1 compute a message digest, digest(M), and convert the bit string     into an integer e, -   2 compute u₁=es⁻¹ mod p and u₂=rs⁻¹ mod p, -   3 compute (x₂,y₂)=u₁(x_(B),y_(B))+u₂(x_(Pu),y_(Pu)), and convert x₂     into an integer v mod p, -   4 accept the signature if v=r.

In one embodiment of using (nx+1) coordinates, x₀,x₁, . . . , & x_(nx), for generating a digital nature, the above elliptic curve digital signature can be modified as follows. The entity ch generates a signature has a private key, k_(Pr), and a public key, (x _(0,Pu) ,x _(1,Pu) , . . . ,x _(nx,Pu) ,y _(Pu))=k _(Pr)(x _(0,B) ,x _(1,B) , . . . ,x _(nx,B) ,y _(B))

Given a message M, the entity generating the signature performs the following steps,

-   1 select a random integer, k, mod p, -   2 compute     (x _(0,1) ,x _(1,1) , . . . ,x _(nx,1) ,y ₁)=k(x _(0,B) ,x _(1,B) ,     . . . ,x _(nx,B) ,y _(B))     and concatenate the bits of x_(0,1),x_(1,1), . . . , & x_(nx,1)     together to form a single string [x_(0,1):x_(1,1): . . . :x_(nx,1)]     and convert the combined bit string into an integer r mod p, -   3 compute a message digest, digest(M), and convert the bit string     into an integer e, -   4 compute s=k⁻¹(e+k_(Pr)r) mod p, -   5 signature of the message M is (r,s).

The signature is verified at the receiving entity using the following steps,

-   1 compute a message digest, digest(M), and convert the bit string     into an integer e, -   2 compute u₁=es⁻¹ mod p and u₂=rs⁻¹ mod p, -   3 compute     (x _(0,2) ,x _(1,2) , . . . ,x _(nx,2) ,y ₂)=u ₁(x _(0,B) ,x _(1,B)     , . . . ,x _(nx,B) ,y _(B))+u ₂(x _(0,Pu) ,x _(1,Pu) , . . . ,x     _(nx,Pu) ,y _(Pu))     and concatenate the bits of x_(0,2),x_(1,2), . . . , & x_(nx,2)     together to form a single string [x_(0,1):x_(1,1): . . . :x_(nx,1)]     and convert the combined bit string into an integer v mod p, -   4 accept the signature if v=r.     6.4 Data Embedding in Elliptic Points with Multi x-Coordinates:

One embodiment of the embedding of a message bit string into an elliptic point that satisfies an elliptic polynomial equation with (nx+1) x-coordinates and (ny+1) y-coordinates can be carried out as follows:

-   -   dividing the message bit string into M-bit strings where         ((nx+ny+1)N−L)>M>(N−L),     -   dividing each M-bit string into (nx+ny+1) strings mx₀, mx₁, . .         . ,mx_(nx), my₁, . . . , & my_(ny), wherein the length of string         mxo must be no more than (N−L) bits, while the length of each of         the other “nx+ny” strings mx₁, . . . ,mx_(nx), my₁, . . . , &         my_(ny) must be no more than N bits, and wherein each one of the         (nx+ny+1) bit strings must have an equivalent value which is an         element of the underlying finite field F,     -   assigning the value of the bit strings of mx₁, . . . , & mx_(nx)         to x₁, . . . & x_(nx),     -   assigning the value of the bit strings of my₁, . . . , & my_(ny)         to y₁, . . . & y_(ny),     -   assigning the value of the bit string of mx₀ to x₀     -   substituting the values of x₀,x₁, . . . , & x_(nx) and y₁, . . .         & y_(ny) in a selected elliptic polynomial equation with (nx+1)         x-coordinates and (ny+1) y-coordinates to form a quadratic         equation in y₀,         y ₀ ² +Ay ₀ +B=0

If the quadratic equation in y₀ has solutions for y₀ wherein the solutions are elements of the finite field F, assign one of the solutions to y₀ at random or according to a certain rule, otherwise, continue incrementing x₀ until a quadratic equation of y₀ is formed that has solutions in the finite filed F. Once such solutions are obtained, assign one of the solutions to y₀ at random or according to a certain rule.

It should be noted that in the case of quadratic equations with A=0, the Legendre symbol can be used as an efficient test for the existence of a solution of the quadratic equation above.

7 Security of Elliptic Polynomial Cryptography with Multi x-Coordinates:

The security of elliptic polynomial cryptography with multi x-coordinates is assessed in the following aspects:

-   -   1 the effect on the solution of Elliptic Curve Discrete         Logarithmic Problem (ECDLP),     -   2 power analysis attacks.         7.1 ECDLP in Elliptic Polynomial Cryptography with Multi         x-Coordinates:

It is well known that the elliptic curve discrete logarithm problem (ECDLP) is apparently intractable for non-singular elliptic curves. The ECDLP problem can be stated as follows: given an elliptic curve defined over a finite field F that need N-bit for the representation of its elements, an elliptic curve point (x_(P),y_(P))∈EC² defined in affine coordinates, and a point (x_(Q),y_(Q))∈EC² defined in affine coordinates, determine the integer k, 0≦k≦#F, such that (x_(Q),y_(Q))=k(x_(P),y_(P)) provided that such an integer exist. In what follows, it is assumed that such an integer exists.

The apparent intractability of the following elliptic curve discrete logarithm problem (ECDLP) is the basis of the security of elliptic polynomial cryptosystems with multi x-coordinates. It is assumed that a selected elliptic polynomial equation with additional x-coordinates for use in an elliptic polynomial cryptosystem with multi x-coordinates has a surface or hyper-surface that is non-singular. A non-singular surface or hyper-surface is such that the partial first derivatives at any non-trivial point on the surface or hyper-surface are not all equal to zero.

The ECDLP in elliptic polynomial cryptosystems with multi x-coordinates can be stated as follows: given a point (x_(0,p),x_(1,p), . . . ,x_(nx,p),y_(0,p),y_(1,p), . . . ,y_(ny,p))∈EC^(nx+ny+2) and a point (x_(0,Q),x_(1,Q), . . . ,x_(nx,Q),y_(0,Q),y_(1,Q), . . . ,y_(ny,Q))∈EC^(nx+ny+2), determine an integer k, 0≦k≦#F such that (x_(0,Q),x_(1,Q), . . . ,x_(nx,Q),y_(0,Q),y_(1,Q), . . . ,y_(ny,Q))=k(x_(0,p),x_(1,p), . . . ,x_(nx,p),y_(0,p),y_(1,p), . . . ,y_(ny,p)) provided that such an integer exist.

The most well known attack used against the ECDLP is Pollard p-method, which has a complexity of O(√{square root over (πK)}/2), where K is the order of the underlying group and the complexity is measured in terms of an elliptic curve point addition N.Kobltiz, A. Menezes, S. Vanstone, The state of Elliptic Curve Cryptography, Designs, Codes, and Cryptography, Vol 19, 2000, pp 173-193.

In elliptic polynomial cryptosystems with multi xcoordinates, the modified Pollard p-method can be formulated as follows: find two points (x _(0,i) ,x _(1,i) , . . . ,x _(nx,i) ,y _(0,i) ,y _(1,i) , . . . ,y _(ny,i))=A _(i)(x _(0,Q) ,x _(1,Q) , . . . ,x _(nx,Q) ,y _(0,Q) ,y _(1,Q) , . . . ,y _(ny,Q))+B _(i)(x _(0,p) ,x _(1,p) , . . . ,x _(nx,p) ,y _(0,p) ,y _(1,p) , . . . ,y _(ny,p)) and (x _(0,j) ,x _(1,j) , . . . ,x _(nx,j) ,y _(0,j) ,y _(1,j) , . . . ,y _(ny,j))=A _(j)(x _(0,Q) ,x _(1,Q) , . . . ,x _(nx,Q) ,y _(0,Q) ,y _(1,Q) , . . . ,y _(ny,Q))+B _(j)(x _(0,p) ,x _(1,p) , . . . ,x _(nx,p) ,y _(0,p) ,y _(1,p) , . . . ,y _(ny,p)) such that (x _(0,i) ,x _(1,i) , . . . ,x _(nx,i) ,y _(0,i) ,y _(1,i) , . . . ,y _(ny,i))=(x _(0,j) ,x _(1,j) , . . . ,x _(nx,j) ,y _(0,j) ,y _(1,j) , . . . ,y _(ny,j)) and hence ${k = \frac{A_{i} + A_{j}}{B_{i} + B_{j}}},$ and given that all the points are members of EC^(nx+ny+2).

It is clear that the complexity of the Pollard p-method in elliptic polynomial cryptosystems with multi x-coordinates defined over F is O(√{square root over (π(#EC^(nx+ny+2)))}/2) and where #EC^(nx+ny+2) is proportional to #(F(p))^(nx+ny+1) and # denotes the order of a field or group.

7.2 Security Against SPA and DPA:

Simple and differential power analysis can be used to attack elliptic polynomial cryptosystems with multi x-coordinates in a similar manner in which they are used to attack elliptic curve cryptosystems.

The countermeasures that are used against simple and differential power analysis for elliptic curve cryptosystems are also applicable for elliptic polynomial cryptosystems with multi x-coordinates. For example, the countermeasures proposed by J-S Coron, in “Resistance Against Differential Power Analysis for Elliptic Curve Cryptosystems, Cryptographic Hardware and Embedded Systems, Vol. 1717, Lecture Notes in Computer Science, pp 292-302, Springer-Verlag, 1999”, can all be adopted as countermeasures against power analysis in elliptic polynomial cryptosystems with multi x-coordinates. As an example, the randomized projective coordinate method can be applied in elliptic polynomial cryptosystems with multi x-coordinates by randomizing the coordinates of the projective coordinates, that is (X₀X₁, . . . ,X_(nx),Y₀,Y₁, . . . ,Y_(ny),V)=(X₀λ²,X₁λ², . . . ,X_(nx)λ²,Y₀λ³,Y₁λ³, . . . ,Y_(ny)λ³,Vλ) where λ is a random variable.

8. Projective Coordinates to Embed Extra Message Data Bits:

Projective coordinate can also be used by the sending correspondent and the receiving correspondent to embed extra message data bits in the projective coordinate wherein the addition of the corresponding elliptic points is defined in an extended dimensional space that incorporates the additional x-coordinates and a projective coordinate.

The equations for the addition rule can be obtained following a similar approach as discussed earlier. For example when using an elliptic polynomial equation with (nx+1) x-coordinates and (nx+1) y-coordinates in projective coordinate, a straight line equation is substituted for each variable to obtain a cubic equation in terms of one of the x-coordinates. This cubic equation can be used to identify the third point of intersection between a straight line and the elliptic polynomial in (nx+ny+3) dimensions given two other intersection points. This third point of intersection is used to identify the sum of the given two points.

9 Scalar Multiplication over a Sub-dimensional Space

In section 4, point addition and point doubling are defined over the entire dimensional space which contains all the coordinates. The corresponding scalar multiplication which is implemented as a sequence of point additions and point doublings is therefore defined over the entire dimensional space which contains all the coordinates.

It is possible, however, to define scalar multiplication over a sub-dimensional space which does not contain all the coordinates, but must contain at least one x-coordinate and one y-coordinate. In this case, the corresponding point addition and point doubling are defined in the sub-dimensional space. The variables that denote other coordinates that are not contained in a selected sub-dimensional space are considered to be constants.

Furthermore, a sequence of scalar multiplications can also be defined over different sub-dimensional spaces that contain different x-coordinates and y-coordinates.

Legendre Symbol

The Legendre Symbol is used to test whether an element of F(p) has a square root or not, i.e. whether an element is quadratic residue or not. This implies that one does not need to compute the square root to check if an element has a square root or not. The Legendre Symbol and test is described below:

Given an element of a finite field F(p), say d, the Legendre symbol is defined as $\left( \frac{d}{p} \right).$

To test whether d is quadratic residue or not, the Legendre symbol, $\left( \frac{d}{p} \right),$ is used: $\left( \frac{d}{p} \right) = \left\{ \begin{matrix} {+ 1} & {{if}\quad x\quad{is}\quad{quadratic}\quad{residue}} \\ {0} & {{{if}\quad x} \equiv {0\quad{mod}{\quad\quad}{F(p)}}} \\ {- 1} & {otherwise} \end{matrix} \right.$

While the invention has been described in connection with the preferred embodiments, it should be recognized that changes and modifications may be made therein without departing from the scope of the appended claims. 

1. A method for communicating securely over an insecure communication channel between a pair of correspondents who perform shared key cryptographic operations by implementing respective ones of a pair of complimentary mathematical operations utilizing the scalar multiplication of a shared key representing as a scalar value and a base point, said method comprising the steps of: assembling a data string including information to be transferred from a sending correspondent to a receiving correspondent; performing a complimentary mathematical operation using points that satisfy an elliptic polynomial equation with more than one cubic variable that are termed x-coordinates wherein all the corresponding coordinates of such points are elements of a finite field F, and wherein the addition of any two of these elliptic points is defined over an extended dimensional space that incorporates the additional x-coordinates, and wherein this point addition is computed using arithmetic over a finite filed F; and forwarding the defined set of points over a communication channel to the receiving correspondent and performing the other of the corresponding mathematical cryptographic operations to decrypt the data.
 2. A method for communicating securely over an insecure communication channel between a pair of correspondents according to claim 1 using an elliptic polynomial equation which consists of the sum of many monomials and wherein the equation has more than two independent variables such that: a the maximum total degree of any monomial in the polynomial is three, b at least two variables, termed the x-coordinates, have a maximum degree of three, and each must appear in one of the monomials with a degree of three, c at least one variable, termed the y-coordinate, has a maximum degree of two, and must appear in one of the monomials on its own with a degree of two.
 3. A method of encrypting and decrypting a message bit string in an information processing system by implementing respective ones of a pair of complimentary mathematical operations using a scalar multiplication of a shared key represented as a scalar value and a base point, said method comprising the steps of: assembling a data string including information to be transferred from a sending correspondent to a receiving correspondent; performing a complimentary mathematical operation using points that satisfy an elliptic polynomial equation with more than one cubic variable that are termed x-coordinates wherein all the corresponding coordinates of such points are elements of a finite field F, and wherein the addition of any two of these elliptic points is defined over an extended dimensional space that incorporates the additional x-coordinates, and wherever the point addition is computed using arithmetic over finite filed F; and using an elliptic polynomial equation which consists of the sum of many monomials and wherein the equation has more than two independent variables such that: a the maximum total degree of any monomial in the polynomial is three, b at least two variables, termed the x-coordinates, have a maximum degree of three, and each must appear in one of the monomials with a degree of three, c at least one variable, termed the y-coordinate, has a maximum degree of two, and must appear in one of the monomials on its own with a degree of two. wherein the representation of the corresponding elliptic points include more than one x-coordinate, wherein all the corresponding coordinates of such points are elements of a finite field F represented in N-bit strings, and which includes a step where extra message bits are embedded in the additional x-coordinates; forwarding the defined set of points over a communication channel to the receiving correspondent and performing the other of the corresponding mathematical cryptographic operations to decrypt the data.
 4. A method of encrypting and decrypting a message bit string in an information processing system in accordance with claim 3 wherein predetermined mappings are used to indicate that an elliptic point that has more than one x-coordinate is equivalent to one or more elliptic points that satisfy the same elliptic polynomial equation with more than one x-coordinate, wherein the elliptic points that are equivalent to each other can be substituted for each other at random or according to preselected rules during point addition and/or point doubling operations, and wherein mappings that indicate that an elliptic point is equivalent to itself are also referenced.
 5. A method of encrypting and decrypting a message bit string in an information processing system in accordance with claim 4, wherein nx additional x-coordinates are used and where nx is greater than or equal to one, said method comprising the steps of: embedding a message bit string into the appropriate coordinates including the additional nx x-coordinates, x₀,x₁, . . . , & x_(n), of an elliptic point which is designated as the message point, (x_(0,m),x_(1,m), . . . ,x_(nx,m),˜) where ˜ denotes coordinates that represent non-cubic variables of the same point; providing shared keys, k_(il) for i=1, . . . ,I, and l=1, . . . , L where I & L are greater or equal to one, base points (x_(0,B(i)),x_(1,B(i)), . . . ,x_(nx,B(i)),˜) for i=1, . . . ,I where I is greater or equal to one, to compute the point (x_(0,bk),x_(1,bk), . . . ,x_(nx,bk),˜) using, ${\left( \left. x_{0,{bk}},x_{1,{bk}},\ldots\quad,x_{{nx},{bk}}, \right.\sim \right) = {\sum\limits_{i = 1}^{I}\left( {k_{iL}\left( {k_{{iL} - 1}\ldots\quad\left( {k_{i\quad 1}\left( \left. x_{0,{B{(i)}}},x_{1,{B{(i)}}},\ldots\quad,x_{{nx},{B{(i)}}}, \right.\sim \right)} \right)\ldots}\quad \right)} \right)}};$ computing a cipher point (x_(0,c),x_(1,c), . . . ,x_(nx,c),˜) using (x_(0,c)x_(1,c), . . . ,x_(nx,c),˜)=(x_(0,m),x_(1,m), . . . ,x_(nx,m),˜)+(x_(0,bk),x_(1,bk), . . . ,x_(nx,bk),˜); sending appropriate bits of the coordinates of the cipher point including its additional nx x-coordinates, x_(1,c), . . . & x_(nx,c), and any additional information needed to help the receiving correspondent recover the message bit string without compromising security; using the shared keys, k_(il) for i=1, . . . ,I and l=1, . . . , L where I & L are greater or equal to one, the base points (x_(0,B(i)),x_(1,B(i)), . . . ,x_(nx,B(i)),˜) for i=1, . . . ,I where I is greater or equal to one, and additional information received from the sending correspondent, compute the point (x_(0,bk),x_(1,bk), . . . ,x_(nx,bk),˜) using, ${\left( \left. x_{0,{bk}},x_{1,{bk}},\ldots\quad,x_{{nx},{bk}}, \right.\sim \right) = {\sum\limits_{i = 1}^{I}\left( {k_{iL}\left( {k_{{iL} - 1}\ldots\quad\left( {k_{i\quad 1}\left( \left. x_{0,{B{(i)}}},x_{1,{B{(i)}}},\ldots\quad,x_{{nx},{B{(i)}}}, \right.\sim \right)} \right)\ldots}\quad \right)} \right)}};$ computing the message point (x_(0,m),x_(1,m), . . . ,x_(nx,m),˜) using (x_(0,m),x_(1,m), . . . ,x_(nx,m),˜)=(x_(0,c)x_(1,c), . . . ,x_(nx,c),˜)−(x_(0,bk),x_(1,bk), . . . ,x_(nx,bk),˜) and if need be any additional information received from the sending correspondent; recovering the message bit string from the appropriate coordinates of the message point including its additional nx x-coordinates, x_(1,m), . . . & x_(nx,m), and any additional information received from the sending correspondent.
 6. A method of encrypting and decrypting a message bit string in an information processing system in accordance with claim 5 wherein each point operation used to compute the point (x_(0,bk),x_(1,bk), . . . ,x_(nx,bk),˜) is defined over a designated sub-space that contains at least one x-coordinate and one-y-coordinate, wherein the variables denoting other coordinates not contained in a designated sub-space are considered as constants, and wherein the designated sub-spaces of different point operations can be completely disjoint from each other, or can be shared partially or completely.
 7. A method for encrypting and decrypting a message bit string in an information processing system according to claim 6 wherein embedding of the message bit string into an elliptic point with (nx+1) x-coordinates, x₀,x₁, . . . & x_(nx), and (ny+1) y-coordinates, y₀,y₁, . . . & y_(ny), comprising the steps of: dividing a message bit string into M-bit strings where ((nx+ny+1)N−L)>M>(N−L), dividing each M-bit string into (nx+ny+1) strings mx₀, mx₁, . . . ,mx_(nx), my₁, . . . , & my_(ny), wherein the length of string mx₀ must be no more than (N−L) bits, while the length of each of the other “nx+ny” strings mx₁, . . . ,mx_(nx), my₁, . . . , & my_(ny) must be no more than N bits, and wherein each one of the (nx+ny+1) bit strings must have an equivalent value which is an element of the underlying finite field F, assigning the value of the bit strings of mx₁, . . . , & mx_(nx) to x₁, . . . & x_(nx), assigning the value of the bit strings of my₁, . . . , & my_(ny) to y₁, . . . & y_(ny), assigning the value of the bit string of mx₀ to x₀ substituting the values of x₀,x₁, . . . , & x_(nx) and y₁, . . . & y_(ny) in a selected elliptic polynomial equation with (nx+1) x-coordinates and (ny+1) y-coordinates to form a quadratic equation in y₀, y ₀ ² +Ay ₀ +B=0 If the quadratic equation in y₀ has solutions for y₀ wherein the solutions are elements of the finite field F, assign one of the solutions to y₀ at random or according to a certain rule, otherwise, continue incrementing x₀ until a quadratic equation of y₀ is formed that has solutions in the finite filed F. Once such solutions are obtained, assign one of the solutions to y₀ at random or according to a certain rule, and in the case of quadratic equations with A=0, the Legendre symbol is used as an efficient test for the existence of a solution of a quadratic equation.
 8. A method of encrypting and decrypting a message bit string in an information processing system according to claim 7 in which a projective coordinate is used by the sending correspondent and the receiving correspondent to eliminate the inversion or division during each point addition and doubling operation of a scalar multiplication, and for randomizing the computation in order to provide a counter measure against differential power analysis.
 9. A system for encrypting and decrypting a bit string used in information processing, storage, and transmission, implementing respective ones of a pair of complimentary mathematical operations using scalar multiplication of a shared key represented as a scalar value and a base point, said system comprising: means for assembling a data string including information to be transferred from a sending correspondent to a receiving correspondent; means for performing a complimentary mathematical operation using points that satisfy an elliptic polynomial equation with more than one cubic variable termed x-coordinates, wherein all the corresponding coordinates of such points are elements of a finite field, F, and wherein the addition of any two of these elliptic points is defined over an extended dimensional space that incorporates the additional x-coordinates, and wherein a point addition is computed using arithmetic over a finite field F; and means for forwarding the defined set of points over a communication channel to a receiving correspondent for performing the other of the corresponding mathematical cryptographic operations to decrypt the data, and which is implemented as a pure hardware unit or as a program stored on a computer readable storage device and executed as a digital computer or a combination of both.
 10. A method for communicating securely over an insecure communication channel between a pair of correspondents who perform shared key cryptographic operations by implementing respective ones of a pair of complimentary mathematical operations utilizing the scalar multiplication of a shared key represented as a scalar value and a base point, said method comprising the steps of: assembling a data string including information to be transferred from a sending correspondent to a receiving correspondent; performing a complimentary mathematical operation using points that satisfy an elliptic polynomial equation in projective coordinate with more than one cubic variable that are termed X-coordinates, wherein all the corresponding coordinates of such points are elements of a finite field F, and wherein the addition of any two of these elliptic points is defined over an extended dimensional space that incorporates the additional X-coordinates, as well as a projective coordinate and wherein this point addition is computed using arithmetic over a finite field F; and forwarding the defined set of points over a communication channel to the receiving correspondent and performing the other of the corresponding mathematical cryptographic operations to decrypt the data.
 11. A method for communicating securely over an insecure communication channel between a pair of correspondents according to claim 10 using an elliptic polynomial equation in projective coordinate which consists of the sum of many terms known as monomials and wherein the equation before it is projected using a projective coordinate has more than two independent variables such that: a the maximum total degree of any monomial in the polynomial is three, b at least two variables, termed the x-coordinates, have a maximum degree of three, and each must appear in one of the monomials with a degree of three, c at least one variable, termed the y-coordinate, has a maximum degree of two, and must appear in one of the monomials on its own with a degree of two.
 12. A method of encrypting and decrypting a message bit string in an information processing system by implementing respective ones of a pair of complimentary mathematical operations using the scalar multiplication of a shared key represented as a scalar value and a base point, said method comprising the steps of: assembling a data string including information to be transferred from a sending correspondent to a receiving correspondent; performing a complimentary mathematical operation using points that satisfy an elliptic polynomial equation with more than one cubic variable termed X-coordinates wherein the elliptic polynomial equation is represented in projective coordinate, wherein all the corresponding coordinates of such points are elements of a finite field, F, and wherein the addition of any two of these elliptic points is defined over an extended dimensional space that incorporates the additional X-coordinates as well as a projective coordinate and wherever the point addition is computed using arithmetic over a finite field, F; and using an elliptic polynomial equation which includes the sum of many monomials and wherein the equation before it is projected using a projective coordinate has more than two independent variables such that; a the maximum total degree of any monomial in the polynomial is three, b at least two variables, termed the x-coordinates, have a maximum degree of three, and each must appear in one of the monomials with a degree of three, c at least one variable, termed the y-coordinate, has a maximum degree of two, and must appear in one of the monomials on its own with a degree of two. wherein the representation of the corresponding elliptic points include more than one X-coordinates, and a projective coordinate wherein all the corresponding coordinates of such points are elements of a finite field F represented in N-bit strings, and which includes a step where extra message bits are embedded in the additional X-coordinates, and the projective coordinate; forwarding the defined set of points over a communication channel to the receiving correspondent and performing the other of the correspondents mathematical cryptography operations to decrypt the data.
 13. A method of encrypting and decrypting a message bit string in an information processing system in accordance with claim 12 wherein predetermined mappings are used to indicate that an elliptic point that has more than one X-coordinate and a projective coordinate is equivalent to one or more elliptic points that satisfy the same elliptic polynomial equation in projective coordinate and with more than one X-coordinate, wherein the elliptic points that are equivalent to each other can be substituted for each other at random or according to certain rules during point addition and point doubling operations, and wherein mappings that indicate that an elliptic point is equivalent to itself are also referenced in this claim.
 14. A method for communicating securely over an insecure communication channel between a pair of correspondents in accordance with claim 13, wherein nx additional X-coordinates are used where nx is greater than or equal to one, said method comprising the steps of: embedding a message bit string into the appropriate coordinates including the additional nx X-coordinates, X₁, . . . , & X_(n), and a projective coordinate, Z, of an elliptic point which is designated as the message point, (X_(o,m),X_(1,m), . . . ,X_(nx,m)Z_(m) ˜) where ˜ denotes coordinates that represent non-cubic variables of the same point; providing shared keys, k_(il) for i=1, . . . ,I, and l=1, . . . , L where I & L are greater or equal to one, base points (X_(0,B(i)),X_(1,B(i)), . . . ,X_(n,B(i)),Z_(B(i)),˜) for i=1, . . . ,I where I is greater or equal to one, compute the point (X_(0,bk),X_(1,bk), . . . ,X_(nx,bk),Z_(bk) ˜) using, $\left( \left. X_{0,{bk}},X_{1,{bk}},\ldots\quad,X_{{nx},{bk}},Z_{bk}, \right.\sim \right) = {\sum\limits_{i = 1}^{I}\left( {k_{iL}\left( {k_{{iL} - 1}\ldots\quad\left( {k_{i\quad 1}\left( \left. X_{0,{B{(i)}}},X_{1,{B{(i)}}},\ldots\quad,X_{{nx},{B{(i)}}},Z_{B{(i)}}, \right.\sim \right)} \right)\ldots}\quad \right)} \right)}$ computing a cipher point (X_(0,c),X_(1,c), . . . ,X_(nx,c),Z_(c),˜) using (X_(0,c),X_(1,c), . . . ,X_(nx,c),Z_(c),˜)=(X_(0,m),X_(1,m), . . . ,X_(nx,m),Z_(m),˜)+(X_(0,bk),X_(1,bk), . . . ,X_(nx,bk),Z_(bk),˜) sending appropriate bits of the coordinates of the cipher point including its additional nx X-coordinates, X_(o,c),X_(1,c), . . . & X_(nx,c), and the Z-coordinate, Z_(c), and if need be any additional information needed to help the receiving correspondent recover the message bit string without compromising security; using the shared keys, k_(il) for i=1, . . . I and l=1, . . . , L where I & L are greater or equal to one, the base points (X_(0,B(i)),X_(1,B(i)), . . . ,X_(nx,B(i)),Z_(B(i)),Z_(B(i)),˜) for i=1, . . . ,I where I is greater or equal to one, and if need be any additional information received from the sending correspondent, compute the point (X_(0,bk),X_(1,bk), . . . ,X_(nx,bk),Z_(bk),˜) using, $\left( \left. X_{0,{bk}},X_{1,{bk}},\ldots\quad,X_{{nx},{bk}},Z_{bk}, \right.\sim \right) = {\sum\limits_{i = 1}^{I}\left( {k_{iL}\left( {k_{{iL} - 1}\ldots\quad\left( {k_{i\quad 1}\left( \left. X_{0,{B{(i)}}},X_{1,{B{(i)}}},\ldots\quad,X_{{nx},{B{(i)}}},Z_{B{(i)}}, \right.\sim \right)} \right)\ldots}\quad \right)} \right)}$ computing the message point (X_(0,m),X_(1,m), . . . ,X_(nx,m),Z_(m),˜) using (X_(0,m),X_(1,m), . . . ,X_(nx,m),Z_(m),˜)=(X_(0,c),X_(1,c), . . . ,X_(nx,c),Z_(c) ˜)−(X_(0,bk),X_(1,bk), . . . ,X_(nx,bk),Z_(bk),˜) and if need be any additional information received from the sending correspondent; recovering the message bit string from appropriate coordinates of the message point including its additional nx X-coordinates, X_(0,m),X_(1,m), . . . & X_(nx,m), and the Z-coordinate, Z_(m), and if need be any additional information received from the sending correspondent.
 15. A method for communicating securely over an insecure communication channel between a pair of correspondents in accordance with claim 14 wherein each point operation used to compute the point (X_(0,bk),X_(1,bk), . . . ,X_(nx,bk),Z_(bk),˜) is defined over a designated sub- space that contains at least one X-coordinate and/or the Z-coordinate, and one Y-coordinate, wherein the variables that denote other coordinates not contained in a designated sub-space are considered as constants, and wherein the designated sub-spaces of different point operations can be completely disjointed from each other, or can be shared partially or completely.
 16. A method for communicating securely over an insecure communication channel between a pair of correspondents according to claim 15 wherein embedding of the message bit string into an elliptic point with a projective coordinate, Z, (nx+1) X-coordinates, X₀,X₁, . . . & X_(nx) and (ny+1) Y-coordinates, Y₀,Y₁, . . . & Y_(ny) includes the steps of: dividing a message bit string into M-bit strings where ((nx+ny+2)N−L)>M>(N−L), dividing each M-bit string into (nx+ny+2) strings mX₀, mX₁, . . . ,mX_(nx), mY₁, . . . , mY_(ny), and mZ wherein the length of string mX₀ must be no more than (N−L) bits, while the length of the each of the other “nx+ny+1” strings mX₁, . . . ,mX_(nx), mY₁, . . . , mY_(ny) and mZ is no more than N bits, and wherein each one of the (nx+ny+2) bit strings has an equivalent value which is an element of the underlying finite field F, assigning the value of the bit strings of mX₁, . . . , & mX_(nx) to X₁, . . . & X_(nx), assigning the value of the bit strings of mY₁, . . . , & mY_(ny) to Y₁, . . . & Y_(ny), assigning the value of the bit strings of mZ to Z, assigning the value of the bit string of mX₀ to X₀, substituting the values of X₀,X₁, . . . , & X_(nx),Y₁, . . . & Y_(ny) and Z in a selected elliptic polynomial equation represented in projective coordinate, Z, with (nx+1) X-coordinates, (ny+1) Y-coordinates, to form a quadratic equation in Y₀, Y ₀ ² +AY ₀ +B=0 If the quadratic equation in Y₀ has solutions for Y₀ wherein the solutions are elements of the finite field F, assign one of the solutions to Y₀ at random or according to a certain rule, otherwise, continue incrementing X₀ until a quadratic equation of Y₀ is formed that has solutions in the finite filed F. Once such solutions are obtained, assign one of the solutions to Y₀ at random or according to a certain rule, and in the case of quadratic equations with A=0, the Legendre symbol is used as an efficient test for the existence of a solution of a quadratic equation.
 17. A method for communicating securely over an insecure communication channel between a pair of correspondents according to claim 16 in which a projective coordinate is used by the sending correspondent and the receiving correspondent to eliminate the inversion or division during each point addition and doubling operation of a scalar multiplication, and for randomizing the computation in order to provide a counter measure against differential power analysis.
 18. A system for encrypting and decrypting a bit string used in information processing, storage, and transmission, implementing respective ones of a pair of complimentary mathematical operations using scalar multiplication of a shared key represented as a scalar value and a base point, said system comprising: means for assembling a data string including information to be transferred from a sending correspondent to a receiving correspondent; means for performing a complimentary mathematical operation using points that satisfy an elliptic polynomial equation in projective coordinate with more than one cubic variable that are termed X-coordinates, wherein all the corresponding coordinates of such points are elements of a finite field, F, and wherein the addition of any two of these elliptic points is defined over an extended dimensional space that incorporates the additional X-coordinates, and a projective coordinate and wherein a point addition is computed using arithmetic over a finite field, F; and means for forwarding the defined set of points over a communication channel to a receiving correspondent for performing the other of the corresponding mathematical cryptographic operations to decrypt the data, and which is implemented as a pure hardware unit or as a program stored on a computer readable storage device and executed as a digital computer or a combination of both.
 19. A method for transferring data over a communication channel between a pair of correspondents who perform public key cryptographic operations by implementing respective ones of a pair of complimentary mathematical operations utilizing a private key of one of the correspondents represented as a scalar value and a public key of the other correspondent represented as an elliptic point, said method comprising the steps of: assembling a data string including information to be transferred from a sending correspondent to a receiving correspondent; performing a complimentary mathematical operation using points that satisfy an elliptic polynomial equation with more than one cubic variable that are termed x-coordinates wherein all the corresponding coordinates of such points are elements of a finite field, F, and wherein the addition of any two of these elliptic points is defined over an extended dimensional that incorporates the additional x-coordinates, and wherein this point addition is computed using arithmetic over a finite field, F; and forwarding the defined set of points over a communication channel to the receiving correspondent and performing the other of the corresponding mathematical operations of the public key and the private key cryptographic operation to decrypt the data.
 20. A method for transferring data over a communication channel between a pair of correspondents according to claim 19 using an elliptic polynomial equation which consists of many monomials and wherein the equation has more than two independent variables such that: a the maximum total degree of any monomial in the polynomial is three, b at least two variables, termed the x-coordinates, have a maximum degree of three, and each must appear in one of the monomials with a degree of three, c at least one variable, termed the y-coordinate, has a maximum degree of two, and must appear in one of the monomials on its own with a degree of two.
 21. A method of encrypting and decrypting a message bit string in an information processing system by implementing respective ones of a pair of complimentary mathematical operations using the scalar multiplication of a private key of one of the correspondents represented as a scalar value and the public key of the other correspondent represented as an elliptic point, said method comprising the steps of: assembling a data string including information to be transferred from a sending correspondent to a receiving correspondent; performing a complimentary mathematical operation using points that satisfy an elliptic polynomial equation with more than one cubic variable termed x-coordinates wherein all the corresponding coordinates of such points are elements of a finite field, F, and wherein the addition of any two of these elliptic points is defined over an extended dimensional space that incorporates the additional x-coordinates, and wherever the point addition is computed using arithmetic over a finite field, F; and using an elliptic polynomial equation which includes the sum of many monomials and wherein the equation has more than two independent variables such that; a the maximum total degree of any monomial in the polynomial is three, b at least two variables, termed the x-coordinates, have a maximum degree of three, and each must appear in one of the monomials with a degree of three, c at least one variable, termed the y-coordinate, has a maximum degree of two, and must appear in one of the monomials on its own with a degree of two. wherein the representation of the corresponding elliptic points include more than one x-coordinate, wherein all the coordinates of such points are elements of F represented in N-bit strings, and which includes a step where extra message bits are embedded in the additional x-coordinates; forwarding the defined set of points over a communication channel to the receiving correspondent and performing the other of the corresponding mathematical operations of the public key and the private key cryptographic operation to decrypt the data.
 22. A method of encrypting and decrypting a message bit string in an information processing system in accordance with claim 21 wherein predetermined mappings are used to indicate that an elliptic point that has more than one x-coordinate is equivalent to one or more elliptic points that satisfy the same elliptic polynomial equation with more than one x-coordinate, wherein the elliptic points that are equivalent to each other can be substituted for each other at random or according to certain rules during point addition and point doubling operations, and wherein mappings that indicate that an elliptic point is equivalent to itself are also referenced.
 23. A method of encrypting and decrypting a message bit string in an information processing system in accordance with claim 22, wherein nx additional x-coordinates are used and where nx is greater than or equal than one, said method comprising the steps of: embedding a message bit string into the appropriate coordinates including the additional nx x-coordinates, x₁, . . . , & x_(nx), of an elliptic point which is designated as the message point, (x_(0,m),x_(1,m), . . . ,x_(nx,m),˜) where -denotes coordinates that represent non-cubic variables of the same point; using the private keys of the sending correspondent, k_(SP(i,l)) for i=1, . . . ,I, and l=1, . . . ,L_(s) where I & L_(s) are greater or equal to one, and the public keys of the receiving correspondent (x_(0,PuR(i)),x_(1,PuR(i)), . . . ,x_(nx,PuR(i))˜) for i=1, . . . ,I where I is greater or equal to one, compute the point (x_(0,bk),x_(1,bk), . . . ,x_(nx,bk),˜) using, ${\left( \left. x_{0,{bk}},x_{1,{bk}},\ldots\quad,x_{{nx},{bk}}, \right.\sim \right) = {\sum\limits_{i = 1}^{I}\left( {k_{{SP}{({i,L_{s}})}}\left( \quad{k_{{SP}{({i,{L_{s} - 1}})}}\ldots\quad\left( {k_{{SP}{({i,\quad 1})}}\left( \left. x_{0,{{PuR}{(i)}}},x_{1,{{PuR}{(i)}}},\ldots\quad,x_{{nx},{{PuR}{(i)}}}, \right.\sim \right)} \right)\ldots}\quad \right)} \right)}};$ computing a cipher point (x_(0,c),x_(1,c), . . . ,x_(nx,c),˜) using (x_(0,c),x_(1,c), . . . ,x_(nx,c),˜)=(x_(0,m),x_(1,m), . . . ,x_(nx,m),˜)+(x_(0,bk),x_(1,bk), . . . ,x_(nx,bk),˜); sending appropriate bits of the coordinates of the cipher point including its additional nx x-coordinates, x_(1,c), . . . & x_(nx,c), and any additional information needed to help the receiving correspondent recover the message bit string without compromising security; using the private keys of the receiving correspondent, k_(RP(i,l)) for i=1, . . . ,I, and l=1, . . . ,L_(R) where I & L_(R) are greater or equal to one, and the public keys of the sending correspondent (x_(0,PuS(i)),x_(1,PuS(i)), . . . ,x_(nx,PuS(i)),˜) for i=1, . . . , I where I is greater or equal to one, and if need be any additional information received from the sending correspondent, compute the point (x_(0,bk),x_(1,bk), . . . ,x_(nx,bk),˜) or its equivalent using, $\left( \left. x_{0,{bke}},x_{1,{bke}},\ldots\quad,x_{{nx},{bke}}, \right.\sim \right) = {\sum\limits_{i = 1}^{I}\left( {k_{{RP}{({i,L_{R}})}}\left( \quad{k_{{RP}{({i,{L_{R} - 1}})}}\ldots\quad\left( {k_{{RP}{({i,1})}}\left( \left. x_{0,{{PrS}{(i)}}},x_{i,{{PuS}{(i)}}},\ldots\quad,x_{{nx},{{PuS}{(i)}}}, \right.\sim \right)} \right)\ldots}\quad \right)} \right)}$ and wherein (x_(0,bke),x_(1,bke), . . . ,x_(nx,bke),˜) is equivalent to (x_(0,bk),x_(1,bk), . . . ,x_(nx,bk),˜); computing the message point (x_(0,m),x_(1,m), . . . ,x_(nx,m),˜) using (x _(0,m) ,x _(1,m) , . . . ,x _(nx,m),˜)=(x _(0,c) ,x _(1,c) , . . . ,x _(nx,c),˜)−(x _(0,bk) ,x _(1,bk) , . . . ,x _(nx,bk),˜) and if need be any additional information received from the sending correspondent; recovering the message bit string from the appropriate coordinates of the message point including its additional nx x-coordinates, x_(1,m), . . . & x_(ny,m), and if need be any additional information received from the sending correspondent.
 24. A method of encrypting and decrypting a message bit string in an information processing system in accordance with claim 23 wherein the private keys of a correspondent entity k_(P(i,l)) ^((j)) for i=1, . . . ,I, j=1, . . . ,J and l=1, . . . , L where I, J & L are greater or equal to one, and the base points (x_(0,B(i)),x_(1,B(i)), . . . ,x_(nx,B(i)),˜) for i=1, . . . , I where I is greater or equal to one, are used to compute the public keys of the same correspondent entity, (x_(0,Pu(i)),x_(1,Pu(i)), . . . ,x_(nx,Pu(i)),˜) for i=1, . . . ,I where I is greater or equal to one, ${\left( \left. x_{0,{{Pu}{(i)}}},x_{1,{{Pu}{(i)}}},\ldots\quad,x_{{nx},{{Pu}{(i)}}}, \right.\sim \right) = {\sum\limits_{j = 1}^{J}{\text{(}k_{P{({i,L})}}^{(j)}\text{(}k_{P{({i,{L - 1}})}}^{(j)}\ldots\quad\text{(}{k_{P{({i,1})}}^{(j)}\left( \left. x_{0,{B{(i)}}},x_{1,{B{(i)}}},\ldots\quad,x_{{nx},{B{(i)}}}, \right.\sim \right)}\text{)}\ldots\quad\text{)}\text{)}}}};$
 25. A method of encrypting and decrypting a message bit string in an information processing system in accordance with claim 24 wherein each point operation used to compute the point (x_(0,bk),x_(1,bk), . . . ,x_(nx,bk),˜), its equivalent, or the public key points (x_(0,Pu(i)),x_(1,Pu(i)), . . . ,x_(nx,Pu(i)),˜) for i=1, . . . , I where I is greater or equal to one, is defined over a designated sub-space that contains at least one x-coordinate and one y-coordinate, wherein the variables that denote other coordinates not contained in a designated sub-space are considered as constants, and wherein the designated sub-spaces of different point operation can be completely disjoined from each other, or can be shared partially or completely.
 26. A method for encrypting and decrypting a message bit string in an information processing system according to claim 25 wherein embedding of the message bit string into an elliptic point with (nx+1) x-coordinates, x₀,x₁, . . . & x_(nx), and (ny+1) y-coordinates, y₀,y₁, . . . & y_(ny), comprising the steps of: dividing a message bit string into M-bit strings where ((nx+ny+1)N−L)>M>(N−L), dividing each M-bit string into (nx+ny+1) strings mx₀, mx₁, . . . ,mx_(nx), my₁, . . . , & my_(ny), wherein the length of string mxo must be no more than (N−L) bits, while the length of each of the other “nx+ny” strings mx₁, . . . ,mx_(nx), my₁, . . . , & my_(ny) must be no more than N bits, and wherein each one of the (nx+ny+1) bit strings must have an equivalent value which is an element of the underlying finite field F, assigning the value of the bit strings of mx₁, . . . , & mx_(nx) to x₁, . . . & x_(nx), assigning the value of the bit strings of my₁, . . . , & my_(ny) to y₁, . . . & y_(ny), assigning the value of the bit string of mx₀ to x₀ substituting the values of x₀,x₁, . . . , & x_(nx) and y₁, . . . & y_(ny) in a selected elliptic polynomial equation with (nx+1) x-coordinates and (ny+1) y-coordinates to form a quadratic equation in y₀, y ₀ ² +Ay ₀ +B=0 If the quadratic equation in y₀ has solutions for y₀ wherein the solutions are elements of the finite field F, assign one of the solutions to y₀ at random or according to a certain rule, otherwise, continue incrementing x₀ until a quadratic equation of y₀ is formed that has solutions in the finite filed F. Once such solutions are obtained, assign one of the solutions to y₀ at random or according to a certain rule, and in the case of quadratic equations with A=0, the Legendre symbol is used as an efficient test for the existence of a solution of a quadratic equation.
 27. In a method for communicating securely over an insecure communication channel using elliptic polynomial cryptography according to claim 26 in which a projective coordinate is used by the sending correspondent and the receiving correspondent to eliminate the inversion or division during each point addition and doubling operation of a scalar multiplication, and for randomizing the computation in order to provide a counter measure against differential power analysis.
 28. A system for encrypting and decrypting a bit string used in information processing, storage, and transmission, implementing respective ones of a pair of complimentary mathematical operations utilizing a private key of one of the correspondents and a public key of the other correspondent, said system comprising: means for assembling a data string including information to be transferred from a sending correspondent to a receiving correspondent; means for performing a complimentary mathematical operation using points that satisfy an elliptic polynomial equation with more than one cubic variable termed x-coordinates wherein all the corresponding coordinates of such points are elements of a finite field F, and wherein the addition of any two of these elliptic points is defined over an extended dimensional space that incorporates the additional x-coordinates, and wherein a point addition is computed using arithmetic over a finite field, F; and means for forwarding the defined set of points over a communication channel to a receiving correspondent for performing the other of the corresponding mathematical cryptographic operations to decrypt the data, and which is implemented as a pure hardware unit or as a program stored on a computer readable storage device and executed as a digital computer or a combination of both.
 29. A method of encrypting and decrypting a message bit string in an information processing system by implementing respective ones of a pair of complimentary mathematical operations using the scalar multiplication of a private key of one of the correspondents represented as a scalar value and a public key of the other correspondent represented as an elliptic point, said method comprising the steps of: assembling a data string including information to be transferred from a sending correspondent to a receiving correspondent; performing a complimentary mathematical operation using points that satisfy an elliptic polynomial equation with more than one cubic variable termed X-coordinates wherein the elliptic polynomial equation is represented in projective coordinate, wherein all the corresponding coordinates of such points are elements of a finite field, F, and wherein the addition of any two of these elliptic points is defined over an extended dimensional space that incorporates the additional X-coordinates and a projective coordinate and wherever the point addition is computed using arithmetic over a finite field, F; and using an elliptic polynomial equation which includes the sum of many monomials and wherein the equation before it is projected using a projective coordinate has more than two independent variables such that; a the maximum total degree of any monomial in the polynomial is three, b at least two variables, termed the x-coordinates, have a maximum degree of three, and each must appear in one of the monomials with a degree of three, c at least one variable, termed the y-coordinate, has a maximum degree of two, and must appear in one of the monomials on its own with a degree of two. wherein the representation of the corresponding elliptic points include more than one X-coordinate, and a projective coordinate wherein all the corresponding coordinates of such points are elements of F represented in N-bit strings, and which includes a step where extra message bits are embedded in the additional X-coordinates and the projective coordinate; forwarding the defined set of points over a communication channel to the receiving correspondent and performing the other of the correspondents mathematical cryptography operations to decrypt the data.
 30. In a method for communicating securely over an insecure communication channel using elliptic polynomial cryptography, the improvement comprises using more than one cubic variable termed x-coordinates in an elliptic polynomial equation instead of one x-coordinate, wherein all the corresponding coordinates are elements of a finite field F, and wherein the additional x-coordinates are used to embed extra message data bits, and wherein the addition of any two elliptic points that satisfy an elliptic polynomial equation with more than one x-coordinate is defined over an extended dimensional space that incorporates the additional x-coordinates, and wherein this point addition is computed using arithmetic over a finite filed F.
 31. In a method for communicating securely over an insecure communication channel using elliptic polynomial cryptography according to claim 30 in which a projective coordinate is used by the sending correspondent and the receiving correspondent to embed extra message data bits in a projective coordinate wherein the addition of the corresponding elliptic points is defined over the extended dimensional space that incorporates the additional x-coordinates and the projective coordinate.
 32. In a method for communicating securely over an insecure communication channel using elliptic polynomial cryptography according to claim 31 in which a projective coordinate is used by the sending correspondent and the receiving correspondent to eliminate the inversion or division during each point addition and doubling operation of a scalar multiplication, and for randomizing the computation in order to provide a counter measure against differential power analysis.
 33. A method of digital signatures generation and verification using points that satisfy an elliptic polynomial equation with more than one cubic variable termed the x-coordinates wherein all the corresponding coordinates of such points are elements of a finite field, F, wherein the said method is based on using additions of such points, wherein the addition of any two of these elliptic points is defined over an extended dimensional space that incorporates the additional x-coordinates and wherein this point addition is computed using arithmetic over a finite field F.
 34. A method of digital signatures generation and verification in accordance with claim 33, wherein nx additional x-coordinates are used and where nx is greater than or equal to one, wherein the entity which generates a signature has a private key, k_(Pr), and a public key, wherein (x _(0,Pu) ,x _(1,Pu) , . . . ,x _(nx,Pu),˜)=k _(Pr)(x _(0,B) ,x _(1,B) , . . . ,x _(nx,B),˜) where ˜ denotes coordinates that represent non-cubic variables of the same point, and wherein given a message M, the entity generating the signature performs the following steps, 1 select a random integer, k, mod p, 2 compute (x _(0,1) ,x _(1,1) , . . . ,x _(nx,1),˜)=k(x _(0,B) ,x _(1,B) , . . . ,x _(nx,B),˜) and concatenate the bits of all the relevant coordinates including x_(0,1),x_(1,1), . . . , & x_(nx,1) together to form a single bit string [x_(0,1):x_(1,1): . . . :x_(nx,1):%] where % denotes the bit string of the coordinates that represent the relevant non-cubic variables of the same point, and convert the combined bit string into an integer r mod p, 3 compute a message digest, digest(M), and convert the resulting bit string into an integer e, 4 compute s=k⁻¹(e+k_(Pr)r) mod p, 5 signature of the message M is (r,s). and wherein the receiving entity verifies the signature using the following steps, 1 compute a message digest, digest(M), and convert the resulting bit string into an integer e, 2 compute u₁=es⁻¹ mod p and u₂=rs⁻¹ mod p, 3 compute (x _(0,2) ,x _(1,2) , . . . ,x _(nx,2),˜)=u ₁(x _(0,B) ,x _(1,B) , . . . ,x _(nx,B),˜)+u ₂(x _(0,Pu) ,x _(1,Pu) , . . . ,x _(nx,Pu),˜) and concatenate the bits of all the relevant coordinates including x_(0,2),x_(1,2), . . . , & x_(nx,2) together to form a single bit string [x_(0,2):x_(1,2): . . . :x_(nx,2):%] and convert the combined bit string into an integer v mod p, 4 accept the signature if v=r.
 35. A method of digital signatures generation and verification using points that satisfy an elliptic polynomial equation represented in projective coordinate with more than one X-coordinate, wherein all the corresponding coordinate of such points are elements of a finite field, F, wherein the said method is based on using additions of such points, and wherein the addition of any two of these elliptic points is defined over an extended dimensional space that incorporates the additional X-coordinates and a projective coordinate, Z, and wherein this point addition is computed using arithmetic over a finite field F.
 36. A method of digital signatures generation and verification in accordance with claim 35, wherein nx additional X-coordinates are used and where nx is greater than or equal to one, wherein the entity which generates a signature has a private key, k_(Pr), and a public key, (X _(0,Pu) ,X _(1,Pu) , . . . ,X _(nx,Pu) ,Z _(Pu),˜)=k _(Pr)(X _(0,B) ,X _(1,B) , . . . ,X _(nx,B) ,Z _(B) ˜) where ˜ denotes coordinates that represent non-cubic variables of the same point, and wherein given a message M, the entity generating the signature performs the following steps, 1 select a random integer, k, mod p. 2 compute (X _(0,1) ,X _(1,1) , . . . ,X _(nx,1) ,Z ₁,˜)=k(X _(0,B) ,X _(1,B) , . . . ,X _(nx,B) ,Z _(B),˜) and concatenate the bits of all the relevant coordinates including X_(0,1),X_(1,1), . . . , & X_(nx,1), and Z₁ together to form a single bit string [X_(0,1):X_(1,1): . . . :X_(nx,1):Z₁:%] where % denotes the bit string of coordinates that represent the relevant non-cubic variables of the same point, and convert the combined bit string into an integer r mod p, 3 compute a message digest, digest(M), and convert the resulting bit string into an integer e, 4 compute s=k⁻¹ (e+k_(Pr)r) mod p, 5 signature of the message M is (r,s). and wherein the receiving entity verifies the signature using the following steps, 1 compute a message digest, digest(M), and convert the resulting bit string into an integer e, 2 compute u₁=es⁻¹ mod p and u₂=rs⁻¹ mod p, 3 compute (X _(0,2) ,X _(1,2) , . . . ,X _(nx,2) ,Z ₂,˜)=u ₁(X _(0,B) ,X _(1,B) , . . . ,X _(nx,B) ,Z _(B),˜)+u ₂(X _(0,Pu) ,X _(1,Pu) , . . . ,X _(nx,Pu) ,Z _(Pu),˜) and concatenate the bits of all relevant coordinates including X_(0,2),X_(1,2), . . . , & X_(nx,2), and Z₂ together to form a single bit string [X_(0,2):X_(1,2): . . . :X_(nx,2):Z₂:%] and convert the combined bit string into an integer v mod p, 4 accept the signature if v=r. 